./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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_clnt.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 10:20:59,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 10:20:59,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 10:20:59,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 10:20:59,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 10:20:59,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 10:20:59,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 10:20:59,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 10:20:59,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 10:20:59,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 10:20:59,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 10:20:59,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 10:20:59,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 10:20:59,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 10:20:59,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 10:20:59,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 10:20:59,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 10:20:59,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 10:20:59,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 10:20:59,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 10:20:59,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 10:20:59,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 10:20:59,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 10:20:59,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 10:20:59,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 10:20:59,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 10:20:59,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 10:20:59,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 10:20:59,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 10:20:59,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 10:20:59,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 10:20:59,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 10:20:59,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 10:20:59,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 10:20:59,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 10:20:59,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 10:20:59,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 10:20:59,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 10:20:59,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 10:20:59,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 10:20:59,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 10:20:59,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 10:20:59,490 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 10:20:59,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 10:20:59,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 10:20:59,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 10:20:59,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 10:20:59,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 10:20:59,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 10:20:59,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 10:20:59,492 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 10:20:59,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 10:20:59,493 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 10:20:59,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 10:20:59,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 10:20:59,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 10:20:59,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 10:20:59,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 10:20:59,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 10:20:59,494 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 10:20:59,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 10:20:59,494 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 10:20:59,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 10:20:59,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 10:20:59,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 10:20:59,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 10:20:59,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:20:59,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 10:20:59,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 10:20:59,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 10:20:59,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 10:20:59,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 10:20:59,496 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 10:20:59,496 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 10:20:59,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 10:20:59,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 10:20:59,496 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 -> cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 [2021-12-21 10:20:59,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 10:20:59,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 10:20:59,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 10:20:59,703 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 10:20:59,707 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 10:20:59,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2021-12-21 10:20:59,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7633a5e90/de33f1dc442249d58c55f5e3c4268a6d/FLAGe5d77be19 [2021-12-21 10:21:00,156 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 10:21:00,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2021-12-21 10:21:00,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7633a5e90/de33f1dc442249d58c55f5e3c4268a6d/FLAGe5d77be19 [2021-12-21 10:21:00,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7633a5e90/de33f1dc442249d58c55f5e3c4268a6d [2021-12-21 10:21:00,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 10:21:00,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 10:21:00,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 10:21:00,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 10:21:00,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 10:21:00,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:21:00" (1/1) ... [2021-12-21 10:21:00,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aeb93e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:00, skipping insertion in model container [2021-12-21 10:21:00,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:21:00" (1/1) ... [2021-12-21 10:21:00,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 10:21:00,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:21:00,975 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_clnt.blast.02.i.cil-1.c[65397,65410] [2021-12-21 10:21:00,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:21:00,999 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 10:21:01,083 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_clnt.blast.02.i.cil-1.c[65397,65410] [2021-12-21 10:21:01,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:21:01,101 INFO L208 MainTranslator]: Completed translation [2021-12-21 10:21:01,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01 WrapperNode [2021-12-21 10:21:01,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 10:21:01,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 10:21:01,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 10:21:01,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 10:21:01,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,177 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2021-12-21 10:21:01,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 10:21:01,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 10:21:01,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 10:21:01,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 10:21:01,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 10:21:01,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 10:21:01,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 10:21:01,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 10:21:01,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (1/1) ... [2021-12-21 10:21:01,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:21:01,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:21:01,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 10:21:01,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 10:21:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 10:21:01,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 10:21:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 10:21:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 10:21:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 10:21:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 10:21:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 10:21:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 10:21:01,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 10:21:01,468 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 10:21:01,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 10:21:01,483 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-21 10:21:04,212 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-12-21 10:21:04,213 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-12-21 10:21:04,213 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 10:21:04,222 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 10:21:04,223 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 10:21:04,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:21:04 BoogieIcfgContainer [2021-12-21 10:21:04,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 10:21:04,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 10:21:04,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 10:21:04,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 10:21:04,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:21:00" (1/3) ... [2021-12-21 10:21:04,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6a01a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:21:04, skipping insertion in model container [2021-12-21 10:21:04,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:21:01" (2/3) ... [2021-12-21 10:21:04,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6a01a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:21:04, skipping insertion in model container [2021-12-21 10:21:04,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:21:04" (3/3) ... [2021-12-21 10:21:04,231 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2021-12-21 10:21:04,234 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 10:21:04,235 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 10:21:04,266 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 10:21:04,271 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 10:21:04,271 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 10:21:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 10:21:04,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:04,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:04,288 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:04,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2021-12-21 10:21:04,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:04,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879735234] [2021-12-21 10:21:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:04,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:21:04,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:04,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879735234] [2021-12-21 10:21:04,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879735234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:04,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:04,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:04,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085338718] [2021-12-21 10:21:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:04,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:04,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:04,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:04,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:04,783 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 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 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:06,805 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 [] [2021-12-21 10:21:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:07,138 INFO L93 Difference]: Finished difference Result 360 states and 608 transitions. [2021-12-21 10:21:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:07,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-21 10:21:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:07,148 INFO L225 Difference]: With dead ends: 360 [2021-12-21 10:21:07,148 INFO L226 Difference]: Without dead ends: 205 [2021-12-21 10:21:07,150 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:07,152 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 143 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:07,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 378 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 235 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-21 10:21:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-21 10:21:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 136. [2021-12-21 10:21:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.5629629629629629) internal successors, (211), 135 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 211 transitions. [2021-12-21 10:21:07,225 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 211 transitions. Word has length 24 [2021-12-21 10:21:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:07,225 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 211 transitions. [2021-12-21 10:21:07,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 211 transitions. [2021-12-21 10:21:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 10:21:07,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:07,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:07,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 10:21:07,228 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:07,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:07,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2051408280, now seen corresponding path program 1 times [2021-12-21 10:21:07,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:07,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598278361] [2021-12-21 10:21:07,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:07,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:21:07,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:07,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598278361] [2021-12-21 10:21:07,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598278361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:07,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:07,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:07,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663298065] [2021-12-21 10:21:07,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:07,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:07,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:07,463 INFO L87 Difference]: Start difference. First operand 136 states and 211 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:09,481 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 [] [2021-12-21 10:21:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:09,726 INFO L93 Difference]: Finished difference Result 358 states and 553 transitions. [2021-12-21 10:21:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-12-21 10:21:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:09,728 INFO L225 Difference]: With dead ends: 358 [2021-12-21 10:21:09,728 INFO L226 Difference]: Without dead ends: 229 [2021-12-21 10:21:09,729 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:09,730 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:09,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 264 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-21 10:21:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-21 10:21:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 161. [2021-12-21 10:21:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.59375) internal successors, (255), 160 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 255 transitions. [2021-12-21 10:21:09,738 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 255 transitions. Word has length 25 [2021-12-21 10:21:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:09,738 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 255 transitions. [2021-12-21 10:21:09,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 255 transitions. [2021-12-21 10:21:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:21:09,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:09,740 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:09,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 10:21:09,740 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:09,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash -144154468, now seen corresponding path program 1 times [2021-12-21 10:21:09,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:09,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418001127] [2021-12-21 10:21:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:09,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:21:09,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:09,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418001127] [2021-12-21 10:21:09,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418001127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:09,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:09,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:09,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808228949] [2021-12-21 10:21:09,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:09,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:09,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:09,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:09,936 INFO L87 Difference]: Start difference. First operand 161 states and 255 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:11,951 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 [] [2021-12-21 10:21:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:12,179 INFO L93 Difference]: Finished difference Result 408 states and 639 transitions. [2021-12-21 10:21:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-21 10:21:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:12,180 INFO L225 Difference]: With dead ends: 408 [2021-12-21 10:21:12,180 INFO L226 Difference]: Without dead ends: 254 [2021-12-21 10:21:12,181 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:12,182 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 110 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:12,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-21 10:21:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-21 10:21:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 183. [2021-12-21 10:21:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.6043956043956045) internal successors, (292), 182 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 292 transitions. [2021-12-21 10:21:12,189 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 292 transitions. Word has length 45 [2021-12-21 10:21:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:12,189 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 292 transitions. [2021-12-21 10:21:12,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 292 transitions. [2021-12-21 10:21:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 10:21:12,191 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:12,191 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-21 10:21:12,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 10:21:12,192 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash 205659207, now seen corresponding path program 1 times [2021-12-21 10:21:12,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:12,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235253138] [2021-12-21 10:21:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:12,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:21:12,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:12,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235253138] [2021-12-21 10:21:12,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235253138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:12,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:12,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:12,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693475744] [2021-12-21 10:21:12,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:12,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:12,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:12,382 INFO L87 Difference]: Start difference. First operand 183 states and 292 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:14,395 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 [] [2021-12-21 10:21:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:14,624 INFO L93 Difference]: Finished difference Result 427 states and 670 transitions. [2021-12-21 10:21:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2021-12-21 10:21:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:14,626 INFO L225 Difference]: With dead ends: 427 [2021-12-21 10:21:14,626 INFO L226 Difference]: Without dead ends: 251 [2021-12-21 10:21:14,627 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:14,627 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 109 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:14,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 276 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-21 10:21:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-21 10:21:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 183. [2021-12-21 10:21:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.5934065934065933) internal successors, (290), 182 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 290 transitions. [2021-12-21 10:21:14,634 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 290 transitions. Word has length 46 [2021-12-21 10:21:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:14,634 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 290 transitions. [2021-12-21 10:21:14,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 290 transitions. [2021-12-21 10:21:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 10:21:14,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:14,636 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:14,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 10:21:14,636 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1474224769, now seen corresponding path program 1 times [2021-12-21 10:21:14,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:14,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064414127] [2021-12-21 10:21:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:14,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:21:14,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:14,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064414127] [2021-12-21 10:21:14,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064414127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:14,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:14,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:14,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600918224] [2021-12-21 10:21:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:14,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:14,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:14,809 INFO L87 Difference]: Start difference. First operand 183 states and 290 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:16,823 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 [] [2021-12-21 10:21:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:17,133 INFO L93 Difference]: Finished difference Result 454 states and 709 transitions. [2021-12-21 10:21:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-21 10:21:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:17,135 INFO L225 Difference]: With dead ends: 454 [2021-12-21 10:21:17,135 INFO L226 Difference]: Without dead ends: 278 [2021-12-21 10:21:17,136 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:17,136 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 95 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:17,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 278 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-21 10:21:17,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-21 10:21:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 221. [2021-12-21 10:21:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.6090909090909091) internal successors, (354), 220 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 354 transitions. [2021-12-21 10:21:17,143 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 354 transitions. Word has length 60 [2021-12-21 10:21:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:17,143 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 354 transitions. [2021-12-21 10:21:17,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 354 transitions. [2021-12-21 10:21:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 10:21:17,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:17,145 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-21 10:21:17,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 10:21:17,145 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1037370134, now seen corresponding path program 1 times [2021-12-21 10:21:17,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:17,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995558036] [2021-12-21 10:21:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:17,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 10:21:17,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:17,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995558036] [2021-12-21 10:21:17,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995558036] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:17,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:17,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:17,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023314341] [2021-12-21 10:21:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:17,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:17,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:17,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:17,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:17,285 INFO L87 Difference]: Start difference. First operand 221 states and 354 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:19,296 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 [] [2021-12-21 10:21:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:19,438 INFO L93 Difference]: Finished difference Result 439 states and 702 transitions. [2021-12-21 10:21:19,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:19,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-12-21 10:21:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:19,439 INFO L225 Difference]: With dead ends: 439 [2021-12-21 10:21:19,439 INFO L226 Difference]: Without dead ends: 225 [2021-12-21 10:21:19,439 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:19,440 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 7 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:19,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 403 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2021-12-21 10:21:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-21 10:21:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2021-12-21 10:21:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.600896860986547) internal successors, (357), 223 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 357 transitions. [2021-12-21 10:21:19,444 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 357 transitions. Word has length 61 [2021-12-21 10:21:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:19,445 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 357 transitions. [2021-12-21 10:21:19,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 357 transitions. [2021-12-21 10:21:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-21 10:21:19,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:19,446 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:19,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 10:21:19,446 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:19,446 INFO L85 PathProgramCache]: Analyzing trace with hash 293122238, now seen corresponding path program 1 times [2021-12-21 10:21:19,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:19,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523035659] [2021-12-21 10:21:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:19,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-21 10:21:19,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:19,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523035659] [2021-12-21 10:21:19,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523035659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:19,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:19,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:21:19,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778844234] [2021-12-21 10:21:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:19,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:21:19,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:21:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:21:19,605 INFO L87 Difference]: Start difference. First operand 224 states and 357 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:19,623 INFO L93 Difference]: Finished difference Result 647 states and 1037 transitions. [2021-12-21 10:21:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:21:19,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 75 [2021-12-21 10:21:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:19,625 INFO L225 Difference]: With dead ends: 647 [2021-12-21 10:21:19,625 INFO L226 Difference]: Without dead ends: 433 [2021-12-21 10:21:19,626 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:19,627 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 104 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:19,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 311 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:21:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-12-21 10:21:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2021-12-21 10:21:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 1.5949074074074074) internal successors, (689), 432 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 689 transitions. [2021-12-21 10:21:19,648 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 689 transitions. Word has length 75 [2021-12-21 10:21:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:19,649 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 689 transitions. [2021-12-21 10:21:19,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 689 transitions. [2021-12-21 10:21:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-21 10:21:19,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:19,650 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-21 10:21:19,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 10:21:19,650 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1323264230, now seen corresponding path program 1 times [2021-12-21 10:21:19,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871818312] [2021-12-21 10:21:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:19,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 10:21:19,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:19,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871818312] [2021-12-21 10:21:19,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871818312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:19,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:19,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:19,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358719473] [2021-12-21 10:21:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:19,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:19,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:19,803 INFO L87 Difference]: Start difference. First operand 433 states and 689 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) [2021-12-21 10:21:21,816 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 [] [2021-12-21 10:21:23,829 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 [] [2021-12-21 10:21:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:24,013 INFO L93 Difference]: Finished difference Result 683 states and 1087 transitions. [2021-12-21 10:21:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:24,014 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 90 [2021-12-21 10:21:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:24,015 INFO L225 Difference]: With dead ends: 683 [2021-12-21 10:21:24,015 INFO L226 Difference]: Without dead ends: 469 [2021-12-21 10:21:24,016 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:24,016 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 33 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:24,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 470 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-21 10:21:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-12-21 10:21:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 451. [2021-12-21 10:21:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 450 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 719 transitions. [2021-12-21 10:21:24,025 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 719 transitions. Word has length 90 [2021-12-21 10:21:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:24,026 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 719 transitions. [2021-12-21 10:21:24,026 INFO L471 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) [2021-12-21 10:21:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 719 transitions. [2021-12-21 10:21:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-21 10:21:24,031 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:24,031 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:24,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 10:21:24,032 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:24,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 473213582, now seen corresponding path program 2 times [2021-12-21 10:21:24,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:24,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560321267] [2021-12-21 10:21:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:24,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:21:24,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:24,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560321267] [2021-12-21 10:21:24,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560321267] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:24,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:24,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:24,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061465084] [2021-12-21 10:21:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:24,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:24,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:24,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:24,199 INFO L87 Difference]: Start difference. First operand 451 states and 719 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:26,207 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 [] [2021-12-21 10:21:28,216 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 [] [2021-12-21 10:21:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:28,450 INFO L93 Difference]: Finished difference Result 1022 states and 1607 transitions. [2021-12-21 10:21:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:28,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-12-21 10:21:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:28,452 INFO L225 Difference]: With dead ends: 1022 [2021-12-21 10:21:28,452 INFO L226 Difference]: Without dead ends: 581 [2021-12-21 10:21:28,453 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:28,453 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 110 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:28,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 294 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-21 10:21:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-12-21 10:21:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 451. [2021-12-21 10:21:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.5777777777777777) internal successors, (710), 450 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 710 transitions. [2021-12-21 10:21:28,466 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 710 transitions. Word has length 104 [2021-12-21 10:21:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:28,467 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 710 transitions. [2021-12-21 10:21:28,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 710 transitions. [2021-12-21 10:21:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-21 10:21:28,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:28,468 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:28,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 10:21:28,469 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash -64795988, now seen corresponding path program 1 times [2021-12-21 10:21:28,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:28,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232220854] [2021-12-21 10:21:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:28,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:21:28,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:28,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232220854] [2021-12-21 10:21:28,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232220854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:28,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:28,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:28,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347036920] [2021-12-21 10:21:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:28,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:28,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:28,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:28,623 INFO L87 Difference]: Start difference. First operand 451 states and 710 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:30,633 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 [] [2021-12-21 10:21:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:30,859 INFO L93 Difference]: Finished difference Result 1023 states and 1590 transitions. [2021-12-21 10:21:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-12-21 10:21:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:30,862 INFO L225 Difference]: With dead ends: 1023 [2021-12-21 10:21:30,862 INFO L226 Difference]: Without dead ends: 582 [2021-12-21 10:21:30,862 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:30,863 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:30,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 276 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-21 10:21:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-12-21 10:21:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 451. [2021-12-21 10:21:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.5577777777777777) internal successors, (701), 450 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 701 transitions. [2021-12-21 10:21:30,884 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 701 transitions. Word has length 104 [2021-12-21 10:21:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:30,884 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 701 transitions. [2021-12-21 10:21:30,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 701 transitions. [2021-12-21 10:21:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-21 10:21:30,886 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:30,886 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:30,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 10:21:30,886 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash -905888681, now seen corresponding path program 1 times [2021-12-21 10:21:30,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:30,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483939750] [2021-12-21 10:21:30,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:30,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:21:31,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:31,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483939750] [2021-12-21 10:21:31,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483939750] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:31,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:31,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:31,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856408074] [2021-12-21 10:21:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:31,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:31,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:31,052 INFO L87 Difference]: Start difference. First operand 451 states and 701 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) [2021-12-21 10:21:33,067 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 [] [2021-12-21 10:21:35,080 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 [] [2021-12-21 10:21:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:35,236 INFO L93 Difference]: Finished difference Result 700 states and 1087 transitions. [2021-12-21 10:21:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:35,237 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 105 [2021-12-21 10:21:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:35,239 INFO L225 Difference]: With dead ends: 700 [2021-12-21 10:21:35,239 INFO L226 Difference]: Without dead ends: 468 [2021-12-21 10:21:35,239 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:35,239 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 35 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:35,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 466 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-21 10:21:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-21 10:21:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 451. [2021-12-21 10:21:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.5555555555555556) internal successors, (700), 450 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2021-12-21 10:21:35,249 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 105 [2021-12-21 10:21:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:35,249 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2021-12-21 10:21:35,249 INFO L471 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) [2021-12-21 10:21:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2021-12-21 10:21:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-21 10:21:35,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:35,250 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:35,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 10:21:35,251 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash 44624593, now seen corresponding path program 1 times [2021-12-21 10:21:35,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:35,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365355513] [2021-12-21 10:21:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:35,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:21:35,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:35,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365355513] [2021-12-21 10:21:35,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365355513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:35,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:35,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:35,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680211488] [2021-12-21 10:21:35,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:35,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:35,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:35,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:35,417 INFO L87 Difference]: Start difference. First operand 451 states and 700 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) [2021-12-21 10:21:37,431 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 [] [2021-12-21 10:21:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:37,667 INFO L93 Difference]: Finished difference Result 1023 states and 1570 transitions. [2021-12-21 10:21:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:37,667 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 106 [2021-12-21 10:21:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:37,669 INFO L225 Difference]: With dead ends: 1023 [2021-12-21 10:21:37,669 INFO L226 Difference]: Without dead ends: 582 [2021-12-21 10:21:37,670 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:37,670 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 114 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:37,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 276 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-21 10:21:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-12-21 10:21:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 451. [2021-12-21 10:21:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.5355555555555556) internal successors, (691), 450 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 691 transitions. [2021-12-21 10:21:37,679 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 691 transitions. Word has length 106 [2021-12-21 10:21:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:37,680 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 691 transitions. [2021-12-21 10:21:37,680 INFO L471 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) [2021-12-21 10:21:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 691 transitions. [2021-12-21 10:21:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-21 10:21:37,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:37,681 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:37,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 10:21:37,681 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash 700347996, now seen corresponding path program 1 times [2021-12-21 10:21:37,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:37,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417787124] [2021-12-21 10:21:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:37,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:21:37,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:37,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417787124] [2021-12-21 10:21:37,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417787124] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:37,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:37,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:37,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073850721] [2021-12-21 10:21:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:37,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:37,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:37,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:37,859 INFO L87 Difference]: Start difference. First operand 451 states and 691 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:39,871 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 [] [2021-12-21 10:21:41,884 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 [] [2021-12-21 10:21:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:42,023 INFO L93 Difference]: Finished difference Result 691 states and 1060 transitions. [2021-12-21 10:21:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-12-21 10:21:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:42,025 INFO L225 Difference]: With dead ends: 691 [2021-12-21 10:21:42,025 INFO L226 Difference]: Without dead ends: 459 [2021-12-21 10:21:42,026 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:42,026 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:42,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 450 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2021-12-21 10:21:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-12-21 10:21:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 451. [2021-12-21 10:21:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.5333333333333334) internal successors, (690), 450 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 690 transitions. [2021-12-21 10:21:42,036 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 690 transitions. Word has length 107 [2021-12-21 10:21:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:42,036 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 690 transitions. [2021-12-21 10:21:42,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 690 transitions. [2021-12-21 10:21:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-21 10:21:42,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:42,038 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:42,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 10:21:42,038 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash -82572025, now seen corresponding path program 1 times [2021-12-21 10:21:42,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:42,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58627993] [2021-12-21 10:21:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:42,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 10:21:42,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:42,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58627993] [2021-12-21 10:21:42,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58627993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:42,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:42,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:42,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486747744] [2021-12-21 10:21:42,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:42,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:42,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:42,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:42,194 INFO L87 Difference]: Start difference. First operand 451 states and 690 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:44,203 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 [] [2021-12-21 10:21:46,214 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 [] [2021-12-21 10:21:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:46,418 INFO L93 Difference]: Finished difference Result 1056 states and 1606 transitions. [2021-12-21 10:21:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-12-21 10:21:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:46,420 INFO L225 Difference]: With dead ends: 1056 [2021-12-21 10:21:46,420 INFO L226 Difference]: Without dead ends: 615 [2021-12-21 10:21:46,421 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:46,421 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 68 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:46,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 532 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-21 10:21:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-21 10:21:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 527. [2021-12-21 10:21:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.543726235741445) internal successors, (812), 526 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 812 transitions. [2021-12-21 10:21:46,434 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 812 transitions. Word has length 108 [2021-12-21 10:21:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:46,435 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 812 transitions. [2021-12-21 10:21:46,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 812 transitions. [2021-12-21 10:21:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-21 10:21:46,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:46,436 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:46,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 10:21:46,436 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash 803875412, now seen corresponding path program 1 times [2021-12-21 10:21:46,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:46,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614651216] [2021-12-21 10:21:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:46,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 10:21:46,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:46,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614651216] [2021-12-21 10:21:46,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614651216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:46,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:46,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:46,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835315640] [2021-12-21 10:21:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:46,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:46,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:46,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:46,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:46,628 INFO L87 Difference]: Start difference. First operand 527 states and 812 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:48,639 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 [] [2021-12-21 10:21:50,656 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 [] [2021-12-21 10:21:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:50,889 INFO L93 Difference]: Finished difference Result 1132 states and 1726 transitions. [2021-12-21 10:21:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:50,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-12-21 10:21:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:50,891 INFO L225 Difference]: With dead ends: 1132 [2021-12-21 10:21:50,891 INFO L226 Difference]: Without dead ends: 615 [2021-12-21 10:21:50,892 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:50,892 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 66 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:50,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 530 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-21 10:21:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-21 10:21:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 529. [2021-12-21 10:21:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5416666666666667) internal successors, (814), 528 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 814 transitions. [2021-12-21 10:21:50,901 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 814 transitions. Word has length 108 [2021-12-21 10:21:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:50,902 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 814 transitions. [2021-12-21 10:21:50,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 814 transitions. [2021-12-21 10:21:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-21 10:21:50,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:50,903 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:50,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 10:21:50,903 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:50,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1879002633, now seen corresponding path program 1 times [2021-12-21 10:21:50,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:50,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003183493] [2021-12-21 10:21:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:50,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 10:21:51,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:51,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003183493] [2021-12-21 10:21:51,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003183493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:51,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:51,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:51,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667346558] [2021-12-21 10:21:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:51,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:51,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:51,107 INFO L87 Difference]: Start difference. First operand 529 states and 814 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:53,123 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 [] [2021-12-21 10:21:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:53,369 INFO L93 Difference]: Finished difference Result 1179 states and 1798 transitions. [2021-12-21 10:21:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:53,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-12-21 10:21:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:53,372 INFO L225 Difference]: With dead ends: 1179 [2021-12-21 10:21:53,372 INFO L226 Difference]: Without dead ends: 660 [2021-12-21 10:21:53,373 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:53,373 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 91 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:53,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 276 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-21 10:21:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-12-21 10:21:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 553. [2021-12-21 10:21:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.5579710144927537) internal successors, (860), 552 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) [2021-12-21 10:21:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 860 transitions. [2021-12-21 10:21:53,385 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 860 transitions. Word has length 108 [2021-12-21 10:21:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:53,385 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 860 transitions. [2021-12-21 10:21:53,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 860 transitions. [2021-12-21 10:21:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-21 10:21:53,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:53,387 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:53,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 10:21:53,387 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1529517226, now seen corresponding path program 1 times [2021-12-21 10:21:53,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:53,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254961830] [2021-12-21 10:21:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:53,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-21 10:21:53,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:53,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254961830] [2021-12-21 10:21:53,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254961830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:53,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:53,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:53,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625009341] [2021-12-21 10:21:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:53,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:53,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:53,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:53,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:53,558 INFO L87 Difference]: Start difference. First operand 553 states and 860 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:55,571 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 [] [2021-12-21 10:21:57,585 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 [] [2021-12-21 10:21:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:21:57,743 INFO L93 Difference]: Finished difference Result 1178 states and 1824 transitions. [2021-12-21 10:21:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:21:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-12-21 10:21:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:21:57,746 INFO L225 Difference]: With dead ends: 1178 [2021-12-21 10:21:57,746 INFO L226 Difference]: Without dead ends: 635 [2021-12-21 10:21:57,746 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:21:57,747 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 37 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:21:57,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 488 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-21 10:21:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-12-21 10:21:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 593. [2021-12-21 10:21:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.5574324324324325) internal successors, (922), 592 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 922 transitions. [2021-12-21 10:21:57,756 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 922 transitions. Word has length 108 [2021-12-21 10:21:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:21:57,757 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 922 transitions. [2021-12-21 10:21:57,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 922 transitions. [2021-12-21 10:21:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-21 10:21:57,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:21:57,758 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:21:57,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 10:21:57,758 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:21:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:21:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash 147177277, now seen corresponding path program 1 times [2021-12-21 10:21:57,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:21:57,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809749501] [2021-12-21 10:21:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:21:57,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:21:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:21:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 10:21:57,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:21:57,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809749501] [2021-12-21 10:21:57,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809749501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:21:57,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:21:57,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:21:57,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033918859] [2021-12-21 10:21:57,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:21:57,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:21:57,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:21:57,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:21:57,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:21:57,957 INFO L87 Difference]: Start difference. First operand 593 states and 922 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:21:59,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 10:22:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:22:00,192 INFO L93 Difference]: Finished difference Result 1283 states and 1966 transitions. [2021-12-21 10:22:00,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:22:00,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-12-21 10:22:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:22:00,194 INFO L225 Difference]: With dead ends: 1283 [2021-12-21 10:22:00,194 INFO L226 Difference]: Without dead ends: 700 [2021-12-21 10:22:00,195 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:22:00,195 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 88 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:22:00,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 272 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-21 10:22:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-12-21 10:22:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 597. [2021-12-21 10:22:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.5570469798657718) internal successors, (928), 596 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 928 transitions. [2021-12-21 10:22:00,205 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 928 transitions. Word has length 109 [2021-12-21 10:22:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:22:00,205 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 928 transitions. [2021-12-21 10:22:00,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 928 transitions. [2021-12-21 10:22:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-21 10:22:00,207 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:22:00,207 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:22:00,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 10:22:00,207 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:22:00,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:22:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1469182628, now seen corresponding path program 1 times [2021-12-21 10:22:00,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:22:00,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976944352] [2021-12-21 10:22:00,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:22:00,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:22:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:22:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-21 10:22:00,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:22:00,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976944352] [2021-12-21 10:22:00,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976944352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:22:00,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:22:00,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:22:00,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174756666] [2021-12-21 10:22:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:22:00,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:22:00,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:22:00,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:22:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:22:00,378 INFO L87 Difference]: Start difference. First operand 597 states and 928 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) [2021-12-21 10:22:02,391 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 [] [2021-12-21 10:22:04,405 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 [] [2021-12-21 10:22:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:22:04,624 INFO L93 Difference]: Finished difference Result 1266 states and 1948 transitions. [2021-12-21 10:22:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:22:04,624 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 110 [2021-12-21 10:22:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:22:04,626 INFO L225 Difference]: With dead ends: 1266 [2021-12-21 10:22:04,626 INFO L226 Difference]: Without dead ends: 679 [2021-12-21 10:22:04,627 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:22:04,627 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 81 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:22:04,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 526 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 222 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-21 10:22:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-12-21 10:22:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 597. [2021-12-21 10:22:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.5536912751677852) internal successors, (926), 596 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 926 transitions. [2021-12-21 10:22:04,637 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 926 transitions. Word has length 110 [2021-12-21 10:22:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:22:04,637 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 926 transitions. [2021-12-21 10:22:04,638 INFO L471 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) [2021-12-21 10:22:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 926 transitions. [2021-12-21 10:22:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-21 10:22:04,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:22:04,639 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:22:04,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 10:22:04,639 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:22:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:22:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash 797770585, now seen corresponding path program 1 times [2021-12-21 10:22:04,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:22:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392713971] [2021-12-21 10:22:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:22:04,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:22:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:22:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 10:22:04,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:22:04,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392713971] [2021-12-21 10:22:04,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392713971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:22:04,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:22:04,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:22:04,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064943557] [2021-12-21 10:22:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:22:04,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:22:04,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:22:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:22:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:22:04,778 INFO L87 Difference]: Start difference. First operand 597 states and 926 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:06,785 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 [] [2021-12-21 10:22:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:22:07,018 INFO L93 Difference]: Finished difference Result 1281 states and 1958 transitions. [2021-12-21 10:22:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:22:07,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 110 [2021-12-21 10:22:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:22:07,021 INFO L225 Difference]: With dead ends: 1281 [2021-12-21 10:22:07,021 INFO L226 Difference]: Without dead ends: 692 [2021-12-21 10:22:07,021 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:22:07,022 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 84 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:22:07,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 278 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-21 10:22:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-12-21 10:22:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 601. [2021-12-21 10:22:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.5533333333333332) internal successors, (932), 600 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 932 transitions. [2021-12-21 10:22:07,033 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 932 transitions. Word has length 110 [2021-12-21 10:22:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:22:07,033 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 932 transitions. [2021-12-21 10:22:07,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 932 transitions. [2021-12-21 10:22:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-21 10:22:07,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:22:07,034 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:22:07,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-21 10:22:07,035 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:22:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:22:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1886579234, now seen corresponding path program 1 times [2021-12-21 10:22:07,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:22:07,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50503255] [2021-12-21 10:22:07,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:22:07,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:22:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:22:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-21 10:22:07,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:22:07,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50503255] [2021-12-21 10:22:07,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50503255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:22:07,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:22:07,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:22:07,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506051852] [2021-12-21 10:22:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:22:07,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:22:07,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:22:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:22:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:22:07,177 INFO L87 Difference]: Start difference. First operand 601 states and 932 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:09,185 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 [] [2021-12-21 10:22:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:22:09,228 INFO L93 Difference]: Finished difference Result 1212 states and 1884 transitions. [2021-12-21 10:22:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:22:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-12-21 10:22:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:22:09,231 INFO L225 Difference]: With dead ends: 1212 [2021-12-21 10:22:09,231 INFO L226 Difference]: Without dead ends: 905 [2021-12-21 10:22:09,232 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:22:09,232 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:22:09,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2021-12-21 10:22:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2021-12-21 10:22:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2021-12-21 10:22:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 1.549778761061947) internal successors, (1401), 904 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1401 transitions. [2021-12-21 10:22:09,248 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1401 transitions. Word has length 110 [2021-12-21 10:22:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:22:09,248 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1401 transitions. [2021-12-21 10:22:09,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1401 transitions. [2021-12-21 10:22:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-21 10:22:09,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:22:09,250 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:22:09,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 10:22:09,250 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:22:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:22:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 722208224, now seen corresponding path program 1 times [2021-12-21 10:22:09,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:22:09,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118624343] [2021-12-21 10:22:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:22:09,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:22:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:22:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-21 10:22:09,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:22:09,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118624343] [2021-12-21 10:22:09,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118624343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:22:09,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:22:09,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 10:22:09,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421617930] [2021-12-21 10:22:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:22:09,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 10:22:09,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:22:09,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 10:22:09,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 10:22:09,404 INFO L87 Difference]: Start difference. First operand 905 states and 1401 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:11,415 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 [] [2021-12-21 10:22:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:22:11,441 INFO L93 Difference]: Finished difference Result 1541 states and 2383 transitions. [2021-12-21 10:22:11,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 10:22:11,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 110 [2021-12-21 10:22:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:22:11,443 INFO L225 Difference]: With dead ends: 1541 [2021-12-21 10:22:11,444 INFO L226 Difference]: Without dead ends: 930 [2021-12-21 10:22:11,444 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:22:11,445 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 16 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:22:11,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 349 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2021-12-21 10:22:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2021-12-21 10:22:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2021-12-21 10:22:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 1.5435952637244348) internal successors, (1434), 929 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1434 transitions. [2021-12-21 10:22:11,458 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1434 transitions. Word has length 110 [2021-12-21 10:22:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:22:11,458 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1434 transitions. [2021-12-21 10:22:11,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:22:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1434 transitions. [2021-12-21 10:22:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-21 10:22:11,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:22:11,460 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:22:11,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-21 10:22:11,461 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:22:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:22:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2021-12-21 10:22:11,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:22:11,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950716702] [2021-12-21 10:22:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:22:11,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:22:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 10:22:12,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 10:22:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 10:22:12,516 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 10:22:12,516 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 10:22:12,517 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 10:22:12,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-21 10:22:12,522 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:22:12,526 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 10:22:12,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 10:22:12 BoogieIcfgContainer [2021-12-21 10:22:12,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 10:22:12,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 10:22:12,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 10:22:12,636 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 10:22:12,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:21:04" (3/4) ... [2021-12-21 10:22:12,654 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 10:22:12,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 10:22:12,654 INFO L158 Benchmark]: Toolchain (without parser) took 72137.48ms. Allocated memory was 121.6MB in the beginning and 268.4MB in the end (delta: 146.8MB). Free memory was 86.9MB in the beginning and 75.0MB in the end (delta: 12.0MB). Peak memory consumption was 158.1MB. Max. memory is 16.1GB. [2021-12-21 10:22:12,655 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 10:22:12,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.01ms. Allocated memory is still 121.6MB. Free memory was 86.9MB in the beginning and 79.1MB in the end (delta: 7.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-21 10:22:12,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.92ms. Allocated memory is still 121.6MB. Free memory was 79.1MB in the beginning and 74.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 10:22:12,655 INFO L158 Benchmark]: Boogie Preprocessor took 83.90ms. Allocated memory is still 121.6MB. Free memory was 74.2MB in the beginning and 67.2MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 10:22:12,655 INFO L158 Benchmark]: RCFGBuilder took 2947.41ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 67.2MB in the beginning and 75.6MB in the end (delta: -8.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2021-12-21 10:22:12,655 INFO L158 Benchmark]: TraceAbstraction took 68409.30ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 74.6MB in the beginning and 75.0MB in the end (delta: -380.0kB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. [2021-12-21 10:22:12,656 INFO L158 Benchmark]: Witness Printer took 18.72ms. Allocated memory is still 268.4MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 10:22:12,656 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 77.6MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.01ms. Allocated memory is still 121.6MB. Free memory was 86.9MB in the beginning and 79.1MB in the end (delta: 7.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.92ms. Allocated memory is still 121.6MB. Free memory was 79.1MB in the beginning and 74.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.90ms. Allocated memory is still 121.6MB. Free memory was 74.2MB in the beginning and 67.2MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2947.41ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 67.2MB in the beginning and 75.6MB in the end (delta: -8.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * TraceAbstraction took 68409.30ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 74.6MB in the beginning and 75.0MB in the end (delta: -380.0kB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. * Witness Printer took 18.72ms. Allocated memory is still 268.4MB. Free memory is still 75.0MB. 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: 1665]: 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 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->info_callback={0:1}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] EXPR s->version VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->version=-6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->init_buf={0:-10}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-7:0}, s={-7:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1325] COND FALSE !(ret <= 0) [L1330] s->state = 4384 [L1331] s->init_num = 0 [L1332] EXPR s->bbio [L1332] EXPR s->wbio VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->bbio={0:-15}, s->wbio={0:-14}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1332] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-7:0}, s={-7:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1340] ret = __VERIFIER_nondet_int() [L1341] COND TRUE blastFlag == 1 [L1342] blastFlag = 2 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1346] COND FALSE !(ret <= 0) [L1351] s->hit VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1356] s->init_num = 0 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:1}, ((s->s3)->tmp.new_cipher)->algorithms=4294967353, (s->s3)->tmp.new_cipher={-8:0}, blastFlag=2, init=1, ret=1, s={-7:0}, s={-7:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=19, s={-7:0}, s={-7:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-7:0}, s={-7:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:1}, blastFlag=4, init=1, ret=0, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1665] reach_error() VAL [={0:1}, blastFlag=4, init=1, ret=0, s={-7:0}, s={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.3s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 62.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 1764 SdHoareTripleChecker+Valid, 62.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1764 mSDsluCounter, 8125 SdHoareTripleChecker+Invalid, 61.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4720 mSDsCounter, 517 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3660 IncrementalHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 517 mSolverCounterUnsat, 3405 mSDtfsCounter, 3660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=930occurred in iteration=22, InterpolantAutomatonStates: 85, 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, 22 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2045 NumberOfCodeBlocks, 2045 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1911 ConstructedInterpolants, 0 QuantifiedInterpolants, 5291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 1532/1532 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 [2021-12-21 10:22:12,692 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...