./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:58:47,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:58:47,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:58:47,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:58:47,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:58:47,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:58:47,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:58:47,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:58:47,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:58:47,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:58:47,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:58:47,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:58:47,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:58:47,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:58:47,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:58:47,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:58:47,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:58:47,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:58:47,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:58:47,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:58:47,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:58:47,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:58:47,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:58:47,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:58:47,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:58:47,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:58:47,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:58:47,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:58:47,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:58:47,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:58:47,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:58:47,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:58:47,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:58:47,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:58:47,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:58:47,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:58:47,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:58:47,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:58:47,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:58:47,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:58:47,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:58:47,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 08:58:47,518 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:58:47,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:58:47,518 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:58:47,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:58:47,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:58:47,519 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:58:47,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:58:47,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:58:47,520 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:58:47,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:58:47,521 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:58:47,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 08:58:47,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:58:47,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:58:47,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:58:47,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:58:47,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:58:47,522 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:58:47,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:58:47,522 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:58:47,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:58:47,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:58:47,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:58:47,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:58:47,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:58:47,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:58:47,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:58:47,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:58:47,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 08:58:47,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 08:58:47,524 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:58:47,524 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:58:47,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:58:47,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:58:47,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2021-12-15 08:58:47,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:58:47,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:58:47,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:58:47,759 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:58:47,760 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:58:47,761 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-12-15 08:58:47,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60b7b71b/0ec834caa488468993b29cbd90aac872/FLAG70905843f [2021-12-15 08:58:48,313 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:58:48,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-12-15 08:58:48,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60b7b71b/0ec834caa488468993b29cbd90aac872/FLAG70905843f [2021-12-15 08:58:48,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60b7b71b/0ec834caa488468993b29cbd90aac872 [2021-12-15 08:58:48,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:58:48,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:58:48,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:58:48,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:58:48,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:58:48,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:58:48" (1/1) ... [2021-12-15 08:58:48,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c3fbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:48, skipping insertion in model container [2021-12-15 08:58:48,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:58:48" (1/1) ... [2021-12-15 08:58:48,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:58:48,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:58:49,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2021-12-15 08:58:49,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:58:49,140 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:58:49,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2021-12-15 08:58:49,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:58:49,272 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:58:49,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49 WrapperNode [2021-12-15 08:58:49,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:58:49,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:58:49,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:58:49,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:58:49,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,348 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 788 [2021-12-15 08:58:49,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:58:49,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:58:49,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:58:49,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:58:49,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:58:49,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:58:49,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:58:49,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:58:49,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (1/1) ... [2021-12-15 08:58:49,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:58:49,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:58:49,462 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-15 08:58:49,464 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-15 08:58:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:58:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 08:58:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 08:58:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 08:58:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 08:58:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 08:58:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 08:58:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:58:49,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:58:49,601 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:58:49,602 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:58:49,612 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-15 08:58:52,326 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-12-15 08:58:52,326 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-12-15 08:58:52,326 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:58:52,334 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:58:52,335 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 08:58:52,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:58:52 BoogieIcfgContainer [2021-12-15 08:58:52,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:58:52,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:58:52,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:58:52,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:58:52,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:58:48" (1/3) ... [2021-12-15 08:58:52,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f818d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:58:52, skipping insertion in model container [2021-12-15 08:58:52,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:49" (2/3) ... [2021-12-15 08:58:52,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f818d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:58:52, skipping insertion in model container [2021-12-15 08:58:52,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:58:52" (3/3) ... [2021-12-15 08:58:52,342 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2021-12-15 08:58:52,346 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:58:52,346 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:58:52,377 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:58:52,381 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-15 08:58:52,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:58:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:58:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-15 08:58:52,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:58:52,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:58:52,398 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:58:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:58:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2021-12-15 08:58:52,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:58:52,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933630982] [2021-12-15 08:58:52,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:58:52,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:58:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:58:52,693 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-15 08:58:52,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:58:52,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933630982] [2021-12-15 08:58:52,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933630982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:58:52,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:58:52,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:58:52,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353012489] [2021-12-15 08:58:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:58:52,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:58:52,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:58:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:58:52,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:58:52,729 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:58:54,749 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-15 08:58:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:58:55,090 INFO L93 Difference]: Finished difference Result 319 states and 533 transitions. [2021-12-15 08:58:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:58:55,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-15 08:58:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:58:55,098 INFO L225 Difference]: With dead ends: 319 [2021-12-15 08:58:55,098 INFO L226 Difference]: Without dead ends: 162 [2021-12-15 08:58:55,102 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-15 08:58:55,106 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 35 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:58:55,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 561 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 08:58:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-15 08:58:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 145. [2021-12-15 08:58:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5416666666666667) internal successors, (222), 144 states have internal predecessors, (222), 0 states have call successors, (0), 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-15 08:58:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 222 transitions. [2021-12-15 08:58:55,155 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 222 transitions. Word has length 47 [2021-12-15 08:58:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:58:55,156 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 222 transitions. [2021-12-15 08:58:55,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:58:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 222 transitions. [2021-12-15 08:58:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-15 08:58:55,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:58:55,158 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:58:55,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 08:58:55,158 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:58:55,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:58:55,159 INFO L85 PathProgramCache]: Analyzing trace with hash -458217405, now seen corresponding path program 1 times [2021-12-15 08:58:55,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:58:55,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176588533] [2021-12-15 08:58:55,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:58:55,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:58:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:58:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:58:55,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:58:55,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176588533] [2021-12-15 08:58:55,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176588533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:58:55,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:58:55,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:58:55,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583214606] [2021-12-15 08:58:55,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:58:55,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:58:55,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:58:55,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:58:55,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:58:55,302 INFO L87 Difference]: Start difference. First operand 145 states and 222 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-15 08:58:57,320 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-15 08:58:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:58:57,569 INFO L93 Difference]: Finished difference Result 286 states and 432 transitions. [2021-12-15 08:58:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:58:57,569 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-15 08:58:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:58:57,570 INFO L225 Difference]: With dead ends: 286 [2021-12-15 08:58:57,570 INFO L226 Difference]: Without dead ends: 162 [2021-12-15 08:58:57,571 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-15 08:58:57,572 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 24 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:58:57,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 450 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:58:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-15 08:58:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 145. [2021-12-15 08:58:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 144 states have internal predecessors, (221), 0 states have call successors, (0), 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-15 08:58:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 221 transitions. [2021-12-15 08:58:57,578 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 221 transitions. Word has length 60 [2021-12-15 08:58:57,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:58:57,578 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 221 transitions. [2021-12-15 08:58:57,579 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-15 08:58:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2021-12-15 08:58:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-15 08:58:57,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:58:57,580 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:58:57,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 08:58:57,580 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:58:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:58:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash -374937149, now seen corresponding path program 1 times [2021-12-15 08:58:57,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:58:57,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146566469] [2021-12-15 08:58:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:58:57,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:58:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:58:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:58:57,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:58:57,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146566469] [2021-12-15 08:58:57,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146566469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:58:57,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:58:57,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:58:57,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954610638] [2021-12-15 08:58:57,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:58:57,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:58:57,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:58:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:58:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:58:57,675 INFO L87 Difference]: Start difference. First operand 145 states and 221 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:58:59,687 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-15 08:58:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:58:59,881 INFO L93 Difference]: Finished difference Result 285 states and 430 transitions. [2021-12-15 08:58:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:58:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-12-15 08:58:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:58:59,883 INFO L225 Difference]: With dead ends: 285 [2021-12-15 08:58:59,883 INFO L226 Difference]: Without dead ends: 161 [2021-12-15 08:58:59,883 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-15 08:58:59,884 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:58:59,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 452 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:58:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-15 08:58:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2021-12-15 08:58:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 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-15 08:58:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 220 transitions. [2021-12-15 08:58:59,891 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 220 transitions. Word has length 61 [2021-12-15 08:58:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:58:59,891 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 220 transitions. [2021-12-15 08:58:59,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:58:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2021-12-15 08:58:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-15 08:58:59,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:58:59,893 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:58:59,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 08:58:59,893 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:58:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:58:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash 470501247, now seen corresponding path program 1 times [2021-12-15 08:58:59,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:58:59,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792654815] [2021-12-15 08:58:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:58:59,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:58:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:58:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:58:59,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:58:59,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792654815] [2021-12-15 08:58:59,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792654815] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:58:59,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:58:59,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:58:59,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792374743] [2021-12-15 08:58:59,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:58:59,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:58:59,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:58:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:58:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:58:59,997 INFO L87 Difference]: Start difference. First operand 145 states and 220 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:02,009 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-15 08:59:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:02,301 INFO L93 Difference]: Finished difference Result 385 states and 588 transitions. [2021-12-15 08:59:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:02,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-12-15 08:59:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:02,302 INFO L225 Difference]: With dead ends: 385 [2021-12-15 08:59:02,302 INFO L226 Difference]: Without dead ends: 261 [2021-12-15 08:59:02,303 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-15 08:59:02,303 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 139 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:02,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 309 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 08:59:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-15 08:59:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 162. [2021-12-15 08:59:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 0 states have call successors, (0), 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-15 08:59:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 247 transitions. [2021-12-15 08:59:02,311 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 247 transitions. Word has length 61 [2021-12-15 08:59:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:02,311 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 247 transitions. [2021-12-15 08:59:02,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 247 transitions. [2021-12-15 08:59:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-15 08:59:02,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:02,312 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:02,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 08:59:02,313 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1212742610, now seen corresponding path program 1 times [2021-12-15 08:59:02,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:02,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556208548] [2021-12-15 08:59:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:02,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:59:02,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556208548] [2021-12-15 08:59:02,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556208548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:02,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:02,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:02,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001119115] [2021-12-15 08:59:02,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:02,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:02,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:02,411 INFO L87 Difference]: Start difference. First operand 162 states and 247 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:04,417 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-15 08:59:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:04,595 INFO L93 Difference]: Finished difference Result 316 states and 481 transitions. [2021-12-15 08:59:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:04,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-15 08:59:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:04,596 INFO L225 Difference]: With dead ends: 316 [2021-12-15 08:59:04,596 INFO L226 Difference]: Without dead ends: 175 [2021-12-15 08:59:04,597 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-15 08:59:04,597 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 26 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:04,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-15 08:59:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2021-12-15 08:59:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 246 transitions. [2021-12-15 08:59:04,602 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 246 transitions. Word has length 62 [2021-12-15 08:59:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:04,603 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 246 transitions. [2021-12-15 08:59:04,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 246 transitions. [2021-12-15 08:59:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-15 08:59:04,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:04,604 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:04,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 08:59:04,604 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1421272766, now seen corresponding path program 1 times [2021-12-15 08:59:04,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:04,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504442816] [2021-12-15 08:59:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:04,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:59:04,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:04,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504442816] [2021-12-15 08:59:04,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504442816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:04,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:04,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:04,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606575007] [2021-12-15 08:59:04,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:04,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:04,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:04,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:04,713 INFO L87 Difference]: Start difference. First operand 162 states and 246 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:06,718 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-15 08:59:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:06,909 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2021-12-15 08:59:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:06,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-15 08:59:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:06,910 INFO L225 Difference]: With dead ends: 316 [2021-12-15 08:59:06,911 INFO L226 Difference]: Without dead ends: 175 [2021-12-15 08:59:06,911 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-15 08:59:06,911 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:06,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-15 08:59:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2021-12-15 08:59:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 0 states have call successors, (0), 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-15 08:59:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 245 transitions. [2021-12-15 08:59:06,923 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 245 transitions. Word has length 62 [2021-12-15 08:59:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:06,923 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 245 transitions. [2021-12-15 08:59:06,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 245 transitions. [2021-12-15 08:59:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-15 08:59:06,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:06,924 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:06,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 08:59:06,925 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash 409565242, now seen corresponding path program 1 times [2021-12-15 08:59:06,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:06,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830231817] [2021-12-15 08:59:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:06,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:59:07,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830231817] [2021-12-15 08:59:07,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830231817] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:07,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:07,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:07,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023715169] [2021-12-15 08:59:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:07,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:07,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:07,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:07,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:07,032 INFO L87 Difference]: Start difference. First operand 162 states and 245 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:09,047 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-15 08:59:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:09,206 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2021-12-15 08:59:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:09,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-12-15 08:59:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:09,207 INFO L225 Difference]: With dead ends: 316 [2021-12-15 08:59:09,207 INFO L226 Difference]: Without dead ends: 175 [2021-12-15 08:59:09,207 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-15 08:59:09,208 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:09,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-15 08:59:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2021-12-15 08:59:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.515527950310559) internal successors, (244), 161 states have internal predecessors, (244), 0 states have call successors, (0), 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-15 08:59:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 244 transitions. [2021-12-15 08:59:09,211 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 244 transitions. Word has length 63 [2021-12-15 08:59:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:09,212 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 244 transitions. [2021-12-15 08:59:09,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 244 transitions. [2021-12-15 08:59:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-15 08:59:09,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:09,212 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:09,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 08:59:09,212 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -682574659, now seen corresponding path program 1 times [2021-12-15 08:59:09,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:09,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949342849] [2021-12-15 08:59:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:09,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:59:09,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:09,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949342849] [2021-12-15 08:59:09,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949342849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:09,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:09,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:09,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752409514] [2021-12-15 08:59:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:09,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:09,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:09,305 INFO L87 Difference]: Start difference. First operand 162 states and 244 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:11,312 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-15 08:59:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:11,582 INFO L93 Difference]: Finished difference Result 419 states and 639 transitions. [2021-12-15 08:59:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:11,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-12-15 08:59:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:11,584 INFO L225 Difference]: With dead ends: 419 [2021-12-15 08:59:11,584 INFO L226 Difference]: Without dead ends: 278 [2021-12-15 08:59:11,584 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-15 08:59:11,585 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 112 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:11,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 310 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 08:59:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-15 08:59:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 205. [2021-12-15 08:59:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5833333333333333) internal successors, (323), 204 states have internal predecessors, (323), 0 states have call successors, (0), 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-15 08:59:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 323 transitions. [2021-12-15 08:59:11,589 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 323 transitions. Word has length 64 [2021-12-15 08:59:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:11,589 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 323 transitions. [2021-12-15 08:59:11,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions. [2021-12-15 08:59:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-15 08:59:11,590 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:11,590 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:11,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 08:59:11,590 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 307896966, now seen corresponding path program 1 times [2021-12-15 08:59:11,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:11,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137768396] [2021-12-15 08:59:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:11,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:59:11,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:11,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137768396] [2021-12-15 08:59:11,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137768396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:11,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:11,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:11,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473915330] [2021-12-15 08:59:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:11,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:11,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:11,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:11,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:11,657 INFO L87 Difference]: Start difference. First operand 205 states and 323 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:13,667 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-15 08:59:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:13,965 INFO L93 Difference]: Finished difference Result 488 states and 769 transitions. [2021-12-15 08:59:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-15 08:59:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:13,968 INFO L225 Difference]: With dead ends: 488 [2021-12-15 08:59:13,968 INFO L226 Difference]: Without dead ends: 302 [2021-12-15 08:59:13,969 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-15 08:59:13,969 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 113 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:13,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 325 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 08:59:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-12-15 08:59:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 230. [2021-12-15 08:59:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.6244541484716157) internal successors, (372), 229 states have internal predecessors, (372), 0 states have call successors, (0), 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-15 08:59:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 372 transitions. [2021-12-15 08:59:13,974 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 372 transitions. Word has length 65 [2021-12-15 08:59:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:13,974 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 372 transitions. [2021-12-15 08:59:13,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 372 transitions. [2021-12-15 08:59:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-15 08:59:13,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:13,975 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:13,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 08:59:13,984 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1634406600, now seen corresponding path program 1 times [2021-12-15 08:59:13,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667329531] [2021-12-15 08:59:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:13,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-15 08:59:14,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:14,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667329531] [2021-12-15 08:59:14,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667329531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:14,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:14,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:14,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310112899] [2021-12-15 08:59:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:14,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:14,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:14,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:14,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:14,075 INFO L87 Difference]: Start difference. First operand 230 states and 372 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-15 08:59:16,089 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-15 08:59:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:16,288 INFO L93 Difference]: Finished difference Result 482 states and 782 transitions. [2021-12-15 08:59:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-12-15 08:59:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:16,290 INFO L225 Difference]: With dead ends: 482 [2021-12-15 08:59:16,290 INFO L226 Difference]: Without dead ends: 273 [2021-12-15 08:59:16,291 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-15 08:59:16,291 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 33 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:16,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 500 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-15 08:59:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-12-15 08:59:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.6294820717131475) internal successors, (409), 251 states have internal predecessors, (409), 0 states have call successors, (0), 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-15 08:59:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 409 transitions. [2021-12-15 08:59:16,298 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 409 transitions. Word has length 94 [2021-12-15 08:59:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:16,298 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 409 transitions. [2021-12-15 08:59:16,298 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-15 08:59:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 409 transitions. [2021-12-15 08:59:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-15 08:59:16,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:16,299 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:16,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 08:59:16,299 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash 217673300, now seen corresponding path program 1 times [2021-12-15 08:59:16,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:16,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791593949] [2021-12-15 08:59:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:16,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:16,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:16,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791593949] [2021-12-15 08:59:16,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791593949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:16,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:16,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:16,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256070943] [2021-12-15 08:59:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:16,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:16,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:16,373 INFO L87 Difference]: Start difference. First operand 252 states and 409 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:18,387 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-15 08:59:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:18,564 INFO L93 Difference]: Finished difference Result 496 states and 808 transitions. [2021-12-15 08:59:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-12-15 08:59:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:18,566 INFO L225 Difference]: With dead ends: 496 [2021-12-15 08:59:18,566 INFO L226 Difference]: Without dead ends: 265 [2021-12-15 08:59:18,566 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-15 08:59:18,567 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 20 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:18,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-12-15 08:59:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 252. [2021-12-15 08:59:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.6254980079681276) internal successors, (408), 251 states have internal predecessors, (408), 0 states have call successors, (0), 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-15 08:59:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 408 transitions. [2021-12-15 08:59:18,573 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 408 transitions. Word has length 94 [2021-12-15 08:59:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:18,576 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 408 transitions. [2021-12-15 08:59:18,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 408 transitions. [2021-12-15 08:59:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-15 08:59:18,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:18,577 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:18,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 08:59:18,577 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1724300080, now seen corresponding path program 1 times [2021-12-15 08:59:18,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:18,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128499665] [2021-12-15 08:59:18,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:18,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:18,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:18,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128499665] [2021-12-15 08:59:18,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128499665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:18,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:18,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:18,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730368854] [2021-12-15 08:59:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:18,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:18,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:18,654 INFO L87 Difference]: Start difference. First operand 252 states and 408 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:20,667 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-15 08:59:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:20,871 INFO L93 Difference]: Finished difference Result 486 states and 794 transitions. [2021-12-15 08:59:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:20,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-12-15 08:59:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:20,873 INFO L225 Difference]: With dead ends: 486 [2021-12-15 08:59:20,873 INFO L226 Difference]: Without dead ends: 255 [2021-12-15 08:59:20,874 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-15 08:59:20,875 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:20,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 472 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-12-15 08:59:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2021-12-15 08:59:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.6215139442231075) internal successors, (407), 251 states have internal predecessors, (407), 0 states have call successors, (0), 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-15 08:59:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 407 transitions. [2021-12-15 08:59:20,880 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 407 transitions. Word has length 95 [2021-12-15 08:59:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:20,881 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 407 transitions. [2021-12-15 08:59:20,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 407 transitions. [2021-12-15 08:59:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-15 08:59:20,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:20,882 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 08:59:20,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 08:59:20,882 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1304679667, now seen corresponding path program 1 times [2021-12-15 08:59:20,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:20,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735571282] [2021-12-15 08:59:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:20,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:20,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:20,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735571282] [2021-12-15 08:59:20,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735571282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:20,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:20,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:20,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958452831] [2021-12-15 08:59:20,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:20,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:20,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:20,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:20,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:20,993 INFO L87 Difference]: Start difference. First operand 252 states and 407 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:23,003 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-15 08:59:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:23,176 INFO L93 Difference]: Finished difference Result 502 states and 814 transitions. [2021-12-15 08:59:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:23,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-12-15 08:59:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:23,177 INFO L225 Difference]: With dead ends: 502 [2021-12-15 08:59:23,177 INFO L226 Difference]: Without dead ends: 271 [2021-12-15 08:59:23,177 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-15 08:59:23,178 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 38 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:23,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 474 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:23,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-15 08:59:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 252. [2021-12-15 08:59:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.6175298804780875) internal successors, (406), 251 states have internal predecessors, (406), 0 states have call successors, (0), 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-15 08:59:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 406 transitions. [2021-12-15 08:59:23,182 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 406 transitions. Word has length 107 [2021-12-15 08:59:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:23,182 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 406 transitions. [2021-12-15 08:59:23,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 406 transitions. [2021-12-15 08:59:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-15 08:59:23,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:23,183 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:23,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 08:59:23,183 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1693697111, now seen corresponding path program 1 times [2021-12-15 08:59:23,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:23,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254467675] [2021-12-15 08:59:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:23,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:23,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:23,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254467675] [2021-12-15 08:59:23,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254467675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:23,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:23,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:23,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16536944] [2021-12-15 08:59:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:23,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:23,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:23,256 INFO L87 Difference]: Start difference. First operand 252 states and 406 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-15 08:59:25,267 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-15 08:59:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:25,455 INFO L93 Difference]: Finished difference Result 501 states and 811 transitions. [2021-12-15 08:59:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-12-15 08:59:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:25,457 INFO L225 Difference]: With dead ends: 501 [2021-12-15 08:59:25,457 INFO L226 Difference]: Without dead ends: 270 [2021-12-15 08:59:25,457 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-15 08:59:25,457 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 35 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:25,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 476 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-12-15 08:59:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 252. [2021-12-15 08:59:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.6135458167330676) internal successors, (405), 251 states have internal predecessors, (405), 0 states have call successors, (0), 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-15 08:59:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 405 transitions. [2021-12-15 08:59:25,464 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 405 transitions. Word has length 108 [2021-12-15 08:59:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:25,464 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 405 transitions. [2021-12-15 08:59:25,464 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-15 08:59:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 405 transitions. [2021-12-15 08:59:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-15 08:59:25,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:25,465 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:25,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 08:59:25,466 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:25,466 INFO L85 PathProgramCache]: Analyzing trace with hash -786830590, now seen corresponding path program 1 times [2021-12-15 08:59:25,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:25,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034582273] [2021-12-15 08:59:25,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:25,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:25,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:25,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034582273] [2021-12-15 08:59:25,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034582273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:25,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:25,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:25,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410958050] [2021-12-15 08:59:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:25,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:25,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:25,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:25,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:25,545 INFO L87 Difference]: Start difference. First operand 252 states and 405 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-15 08:59:27,559 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-15 08:59:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:27,869 INFO L93 Difference]: Finished difference Result 554 states and 881 transitions. [2021-12-15 08:59:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:27,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-12-15 08:59:27,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:27,871 INFO L225 Difference]: With dead ends: 554 [2021-12-15 08:59:27,871 INFO L226 Difference]: Without dead ends: 323 [2021-12-15 08:59:27,871 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-15 08:59:27,872 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 143 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:27,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 08:59:27,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-15 08:59:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 252. [2021-12-15 08:59:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.6015936254980079) internal successors, (402), 251 states have internal predecessors, (402), 0 states have call successors, (0), 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-15 08:59:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 402 transitions. [2021-12-15 08:59:27,876 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 402 transitions. Word has length 109 [2021-12-15 08:59:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:27,876 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 402 transitions. [2021-12-15 08:59:27,876 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-15 08:59:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 402 transitions. [2021-12-15 08:59:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-15 08:59:27,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:27,877 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:27,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 08:59:27,877 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash 778760430, now seen corresponding path program 1 times [2021-12-15 08:59:27,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:27,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747677440] [2021-12-15 08:59:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:27,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:27,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:27,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747677440] [2021-12-15 08:59:27,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747677440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:27,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:27,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:27,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305906016] [2021-12-15 08:59:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:27,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:27,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:27,965 INFO L87 Difference]: Start difference. First operand 252 states and 402 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-15 08:59:29,971 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-15 08:59:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:30,145 INFO L93 Difference]: Finished difference Result 500 states and 802 transitions. [2021-12-15 08:59:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-12-15 08:59:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:30,146 INFO L225 Difference]: With dead ends: 500 [2021-12-15 08:59:30,146 INFO L226 Difference]: Without dead ends: 269 [2021-12-15 08:59:30,146 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-15 08:59:30,147 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 39 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:30,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 478 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-15 08:59:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2021-12-15 08:59:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.597609561752988) internal successors, (401), 251 states have internal predecessors, (401), 0 states have call successors, (0), 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-15 08:59:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 401 transitions. [2021-12-15 08:59:30,152 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 401 transitions. Word has length 109 [2021-12-15 08:59:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:30,152 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 401 transitions. [2021-12-15 08:59:30,152 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-15 08:59:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 401 transitions. [2021-12-15 08:59:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-15 08:59:30,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:30,153 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:30,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 08:59:30,154 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash -939290336, now seen corresponding path program 1 times [2021-12-15 08:59:30,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:30,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170443104] [2021-12-15 08:59:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:30,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:30,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:30,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170443104] [2021-12-15 08:59:30,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170443104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:30,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:30,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:30,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719111423] [2021-12-15 08:59:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:30,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:30,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:30,225 INFO L87 Difference]: Start difference. First operand 252 states and 401 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-15 08:59:32,231 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-15 08:59:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:32,505 INFO L93 Difference]: Finished difference Result 554 states and 873 transitions. [2021-12-15 08:59:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:32,505 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 110 [2021-12-15 08:59:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:32,506 INFO L225 Difference]: With dead ends: 554 [2021-12-15 08:59:32,506 INFO L226 Difference]: Without dead ends: 323 [2021-12-15 08:59:32,507 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-15 08:59:32,507 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:32,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 08:59:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-15 08:59:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 252. [2021-12-15 08:59:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5856573705179282) internal successors, (398), 251 states have internal predecessors, (398), 0 states have call successors, (0), 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-15 08:59:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 398 transitions. [2021-12-15 08:59:32,511 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 398 transitions. Word has length 110 [2021-12-15 08:59:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:32,511 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 398 transitions. [2021-12-15 08:59:32,512 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-15 08:59:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 398 transitions. [2021-12-15 08:59:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-15 08:59:32,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:32,512 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:32,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 08:59:32,512 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:32,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1220545399, now seen corresponding path program 1 times [2021-12-15 08:59:32,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:32,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345668428] [2021-12-15 08:59:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:32,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:32,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:32,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345668428] [2021-12-15 08:59:32,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345668428] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:32,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:32,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:32,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969548509] [2021-12-15 08:59:32,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:32,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:32,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:32,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:32,605 INFO L87 Difference]: Start difference. First operand 252 states and 398 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-15 08:59:34,610 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-15 08:59:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:34,887 INFO L93 Difference]: Finished difference Result 554 states and 867 transitions. [2021-12-15 08:59:34,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:34,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-12-15 08:59:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:34,889 INFO L225 Difference]: With dead ends: 554 [2021-12-15 08:59:34,889 INFO L226 Difference]: Without dead ends: 323 [2021-12-15 08:59:34,889 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-15 08:59:34,890 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 138 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:34,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 08:59:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-15 08:59:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 252. [2021-12-15 08:59:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5737051792828685) internal successors, (395), 251 states have internal predecessors, (395), 0 states have call successors, (0), 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-15 08:59:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 395 transitions. [2021-12-15 08:59:34,895 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 395 transitions. Word has length 111 [2021-12-15 08:59:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:34,895 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 395 transitions. [2021-12-15 08:59:34,895 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-15 08:59:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 395 transitions. [2021-12-15 08:59:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-15 08:59:34,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:34,896 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:34,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 08:59:34,896 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 89193371, now seen corresponding path program 1 times [2021-12-15 08:59:34,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:34,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113863007] [2021-12-15 08:59:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:34,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:59:34,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:34,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113863007] [2021-12-15 08:59:34,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113863007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:34,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:34,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:34,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664566993] [2021-12-15 08:59:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:34,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:34,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:34,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:34,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:34,970 INFO L87 Difference]: Start difference. First operand 252 states and 395 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-15 08:59:36,981 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-15 08:59:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:37,143 INFO L93 Difference]: Finished difference Result 490 states and 775 transitions. [2021-12-15 08:59:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:37,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-12-15 08:59:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:37,144 INFO L225 Difference]: With dead ends: 490 [2021-12-15 08:59:37,144 INFO L226 Difference]: Without dead ends: 259 [2021-12-15 08:59:37,144 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-15 08:59:37,145 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 26 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:37,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 492 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-15 08:59:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2021-12-15 08:59:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5697211155378485) internal successors, (394), 251 states have internal predecessors, (394), 0 states have call successors, (0), 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-15 08:59:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 394 transitions. [2021-12-15 08:59:37,149 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 394 transitions. Word has length 112 [2021-12-15 08:59:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:37,149 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 394 transitions. [2021-12-15 08:59:37,149 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-15 08:59:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 394 transitions. [2021-12-15 08:59:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-15 08:59:37,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:37,150 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:37,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 08:59:37,150 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1884563494, now seen corresponding path program 1 times [2021-12-15 08:59:37,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:37,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177702350] [2021-12-15 08:59:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:37,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-15 08:59:37,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:37,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177702350] [2021-12-15 08:59:37,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177702350] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:37,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:37,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:37,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093575620] [2021-12-15 08:59:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:37,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:37,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:37,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:37,275 INFO L87 Difference]: Start difference. First operand 252 states and 394 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-15 08:59:39,280 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-15 08:59:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:39,473 INFO L93 Difference]: Finished difference Result 532 states and 834 transitions. [2021-12-15 08:59:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:39,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-12-15 08:59:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:39,495 INFO L225 Difference]: With dead ends: 532 [2021-12-15 08:59:39,495 INFO L226 Difference]: Without dead ends: 301 [2021-12-15 08:59:39,496 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-15 08:59:39,497 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 36 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:39,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 512 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 177 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 08:59:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-15 08:59:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2021-12-15 08:59:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.568840579710145) internal successors, (433), 276 states have internal predecessors, (433), 0 states have call successors, (0), 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-15 08:59:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 433 transitions. [2021-12-15 08:59:39,506 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 433 transitions. Word has length 116 [2021-12-15 08:59:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:39,506 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 433 transitions. [2021-12-15 08:59:39,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-15 08:59:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 433 transitions. [2021-12-15 08:59:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-15 08:59:39,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:39,507 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:39,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 08:59:39,508 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash 26479064, now seen corresponding path program 1 times [2021-12-15 08:59:39,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:39,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6473376] [2021-12-15 08:59:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:39,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 08:59:39,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:39,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6473376] [2021-12-15 08:59:39,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6473376] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:39,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:39,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:59:39,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22134691] [2021-12-15 08:59:39,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:39,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:59:39,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:39,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:59:39,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:59:39,580 INFO L87 Difference]: Start difference. First operand 277 states and 433 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:41,586 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-15 08:59:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:41,861 INFO L93 Difference]: Finished difference Result 625 states and 981 transitions. [2021-12-15 08:59:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:59:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-12-15 08:59:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:41,862 INFO L225 Difference]: With dead ends: 625 [2021-12-15 08:59:41,862 INFO L226 Difference]: Without dead ends: 369 [2021-12-15 08:59:41,863 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-15 08:59:41,863 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 83 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:41,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 496 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 08:59:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-12-15 08:59:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 310. [2021-12-15 08:59:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 309 states have internal predecessors, (488), 0 states have call successors, (0), 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-15 08:59:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 488 transitions. [2021-12-15 08:59:41,868 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 488 transitions. Word has length 116 [2021-12-15 08:59:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:41,868 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 488 transitions. [2021-12-15 08:59:41,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 488 transitions. [2021-12-15 08:59:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-15 08:59:41,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:41,869 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:41,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-15 08:59:41,869 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1658817010, now seen corresponding path program 1 times [2021-12-15 08:59:41,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:41,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427665965] [2021-12-15 08:59:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:41,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-15 08:59:41,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:41,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427665965] [2021-12-15 08:59:41,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427665965] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:41,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:41,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:59:41,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939443117] [2021-12-15 08:59:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:41,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:59:41,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:41,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:59:41,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:59:41,989 INFO L87 Difference]: Start difference. First operand 310 states and 488 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:42,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:42,014 INFO L93 Difference]: Finished difference Result 888 states and 1414 transitions. [2021-12-15 08:59:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:59:42,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-12-15 08:59:42,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:42,017 INFO L225 Difference]: With dead ends: 888 [2021-12-15 08:59:42,017 INFO L226 Difference]: Without dead ends: 599 [2021-12-15 08:59:42,017 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-15 08:59:42,018 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 143 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:42,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 558 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:59:42,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-12-15 08:59:42,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2021-12-15 08:59:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.5855704697986577) internal successors, (945), 596 states have internal predecessors, (945), 0 states have call successors, (0), 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-15 08:59:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 945 transitions. [2021-12-15 08:59:42,026 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 945 transitions. Word has length 127 [2021-12-15 08:59:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:42,026 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 945 transitions. [2021-12-15 08:59:42,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 945 transitions. [2021-12-15 08:59:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-15 08:59:42,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:42,028 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:42,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-15 08:59:42,028 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash -390570832, now seen corresponding path program 1 times [2021-12-15 08:59:42,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:42,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197380181] [2021-12-15 08:59:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:42,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 08:59:42,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:42,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197380181] [2021-12-15 08:59:42,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197380181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:42,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:42,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:59:42,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675095544] [2021-12-15 08:59:42,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:42,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:59:42,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:42,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:59:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:59:42,117 INFO L87 Difference]: Start difference. First operand 597 states and 945 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:42,140 INFO L93 Difference]: Finished difference Result 1415 states and 2249 transitions. [2021-12-15 08:59:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:59:42,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-12-15 08:59:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:42,142 INFO L225 Difference]: With dead ends: 1415 [2021-12-15 08:59:42,142 INFO L226 Difference]: Without dead ends: 839 [2021-12-15 08:59:42,144 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-15 08:59:42,147 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 138 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:42,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 431 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:59:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-12-15 08:59:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2021-12-15 08:59:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 1.5787589498806682) internal successors, (1323), 838 states have internal predecessors, (1323), 0 states have call successors, (0), 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-15 08:59:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1323 transitions. [2021-12-15 08:59:42,159 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1323 transitions. Word has length 127 [2021-12-15 08:59:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:42,159 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1323 transitions. [2021-12-15 08:59:42,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1323 transitions. [2021-12-15 08:59:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-15 08:59:42,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:42,161 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:42,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-15 08:59:42,161 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:42,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1945821678, now seen corresponding path program 1 times [2021-12-15 08:59:42,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:42,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268406072] [2021-12-15 08:59:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:42,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-15 08:59:42,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:42,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268406072] [2021-12-15 08:59:42,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268406072] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:42,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:42,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:59:42,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109460450] [2021-12-15 08:59:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:42,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:59:42,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:59:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:59:42,221 INFO L87 Difference]: Start difference. First operand 839 states and 1323 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:42,239 INFO L93 Difference]: Finished difference Result 1684 states and 2658 transitions. [2021-12-15 08:59:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:59:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-12-15 08:59:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:42,241 INFO L225 Difference]: With dead ends: 1684 [2021-12-15 08:59:42,241 INFO L226 Difference]: Without dead ends: 866 [2021-12-15 08:59:42,242 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-15 08:59:42,243 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:42,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 404 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:59:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-12-15 08:59:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2021-12-15 08:59:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 1.569942196531792) internal successors, (1358), 865 states have internal predecessors, (1358), 0 states have call successors, (0), 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-15 08:59:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1358 transitions. [2021-12-15 08:59:42,287 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1358 transitions. Word has length 127 [2021-12-15 08:59:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:42,287 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1358 transitions. [2021-12-15 08:59:42,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1358 transitions. [2021-12-15 08:59:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-15 08:59:42,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:42,289 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:42,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-15 08:59:42,289 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1322540076, now seen corresponding path program 1 times [2021-12-15 08:59:42,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:42,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413905958] [2021-12-15 08:59:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:42,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-15 08:59:42,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:42,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413905958] [2021-12-15 08:59:42,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413905958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:42,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:42,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:59:42,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148825443] [2021-12-15 08:59:42,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:42,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:59:42,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:42,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:59:42,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:59:42,348 INFO L87 Difference]: Start difference. First operand 866 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:42,360 INFO L93 Difference]: Finished difference Result 1426 states and 2232 transitions. [2021-12-15 08:59:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:59:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-12-15 08:59:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:42,362 INFO L225 Difference]: With dead ends: 1426 [2021-12-15 08:59:42,362 INFO L226 Difference]: Without dead ends: 581 [2021-12-15 08:59:42,363 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-15 08:59:42,363 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:42,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:59:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-12-15 08:59:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2021-12-15 08:59:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5482758620689656) internal successors, (898), 580 states have internal predecessors, (898), 0 states have call successors, (0), 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-15 08:59:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 898 transitions. [2021-12-15 08:59:42,374 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 898 transitions. Word has length 127 [2021-12-15 08:59:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:42,375 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 898 transitions. [2021-12-15 08:59:42,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 898 transitions. [2021-12-15 08:59:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-15 08:59:42,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:42,377 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:42,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-15 08:59:42,377 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash -116280318, now seen corresponding path program 1 times [2021-12-15 08:59:42,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:42,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400987448] [2021-12-15 08:59:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:42,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:59:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-12-15 08:59:42,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:59:42,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400987448] [2021-12-15 08:59:42,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400987448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:59:42,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:59:42,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 08:59:42,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511059702] [2021-12-15 08:59:42,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:59:42,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 08:59:42,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:59:42,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 08:59:42,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:59:42,636 INFO L87 Difference]: Start difference. First operand 581 states and 898 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:44,642 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-15 08:59:46,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 08:59:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:59:46,902 INFO L93 Difference]: Finished difference Result 1159 states and 1792 transitions. [2021-12-15 08:59:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 08:59:46,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-12-15 08:59:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:59:46,904 INFO L225 Difference]: With dead ends: 1159 [2021-12-15 08:59:46,904 INFO L226 Difference]: Without dead ends: 581 [2021-12-15 08:59:46,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:59:46,905 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:59:46,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-15 08:59:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-12-15 08:59:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2021-12-15 08:59:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.546551724137931) internal successors, (897), 580 states have internal predecessors, (897), 0 states have call successors, (0), 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-15 08:59:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 897 transitions. [2021-12-15 08:59:46,913 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 897 transitions. Word has length 128 [2021-12-15 08:59:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:59:46,913 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 897 transitions. [2021-12-15 08:59:46,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 897 transitions. [2021-12-15 08:59:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-15 08:59:46,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:46,915 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:46,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-15 08:59:46,915 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2021-12-15 08:59:46,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:59:46,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322700183] [2021-12-15 08:59:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:46,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:59:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 08:59:47,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 08:59:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 08:59:47,417 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 08:59:47,418 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 08:59:47,418 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 08:59:47,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-15 08:59:47,423 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:47,425 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 08:59:47,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:59:47 BoogieIcfgContainer [2021-12-15 08:59:47,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 08:59:47,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 08:59:47,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 08:59:47,533 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 08:59:47,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:58:52" (3/4) ... [2021-12-15 08:59:47,535 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 08:59:47,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 08:59:47,535 INFO L158 Benchmark]: Toolchain (without parser) took 58702.29ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 117.9MB in the beginning and 95.4MB in the end (delta: 22.6MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2021-12-15 08:59:47,536 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:59:47,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.44ms. Allocated memory is still 151.0MB. Free memory was 117.9MB in the beginning and 103.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 08:59:47,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.61ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 98.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 08:59:47,537 INFO L158 Benchmark]: Boogie Preprocessor took 80.38ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 91.9MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 08:59:47,538 INFO L158 Benchmark]: RCFGBuilder took 2899.63ms. Allocated memory is still 151.0MB. Free memory was 91.9MB in the beginning and 69.0MB in the end (delta: 22.9MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2021-12-15 08:59:47,538 INFO L158 Benchmark]: TraceAbstraction took 55194.85ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 68.2MB in the beginning and 95.4MB in the end (delta: -27.2MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2021-12-15 08:59:47,542 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 207.6MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:59:47,545 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 44.0MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.44ms. Allocated memory is still 151.0MB. Free memory was 117.9MB in the beginning and 103.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.61ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 98.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.38ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 91.9MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2899.63ms. Allocated memory is still 151.0MB. Free memory was 91.9MB in the beginning and 69.0MB in the end (delta: 22.9MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 55194.85ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 68.2MB in the beginning and 95.4MB in the end (delta: -27.2MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 207.6MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->info_callback={0:1}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=0, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=11, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___2=0, tmp___8=0, tmp___9=1] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967298:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1166] COND TRUE 1 VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=0, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1618] COND TRUE blastFlag == 5 VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=0, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] [L1737] reach_error() VAL [={0:1}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=0, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=15, tmp___2=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.0s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 23 mSolverCounterUnknown, 1565 SdHoareTripleChecker+Valid, 50.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1565 mSDsluCounter, 11541 SdHoareTripleChecker+Invalid, 49.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6774 mSDsCounter, 480 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4147 IncrementalHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 480 mSolverCounterUnsat, 4767 mSDtfsCounter, 4147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred in iteration=24, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 729 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2590 NumberOfCodeBlocks, 2590 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2436 ConstructedInterpolants, 0 QuantifiedInterpolants, 5276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 1407/1407 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-15 08:59:47,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:59:49,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:59:49,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:59:49,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:59:49,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:59:49,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:59:49,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:59:49,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:59:49,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:59:49,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:59:49,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:59:49,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:59:49,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:59:49,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:59:49,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:59:49,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:59:49,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:59:49,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:59:49,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:59:49,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:59:49,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:59:49,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:59:49,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:59:49,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:59:49,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:59:49,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:59:49,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:59:49,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:59:49,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:59:49,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:59:49,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:59:49,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:59:49,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:59:49,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:59:49,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:59:49,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:59:49,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:59:49,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:59:49,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:59:49,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:59:49,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:59:49,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-15 08:59:49,468 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:59:49,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:59:49,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:59:49,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:59:49,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:59:49,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:59:49,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:59:49,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:59:49,472 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:59:49,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:59:49,473 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:59:49,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:59:49,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:59:49,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:59:49,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:59:49,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:59:49,474 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 08:59:49,474 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 08:59:49,474 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 08:59:49,474 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:59:49,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:59:49,474 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:59:49,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:59:49,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:59:49,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:59:49,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:59:49,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:59:49,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:59:49,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:59:49,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:59:49,476 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 08:59:49,476 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 08:59:49,476 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:59:49,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:59:49,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:59:49,476 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:59:49,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 08:59:49,477 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2021-12-15 08:59:49,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:59:49,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:59:49,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:59:49,722 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:59:49,723 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:59:49,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-12-15 08:59:49,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eebee880/7ec0459042e64746b44fc94082d91c7e/FLAGd9d3952dc [2021-12-15 08:59:50,242 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:59:50,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2021-12-15 08:59:50,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eebee880/7ec0459042e64746b44fc94082d91c7e/FLAGd9d3952dc [2021-12-15 08:59:50,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eebee880/7ec0459042e64746b44fc94082d91c7e [2021-12-15 08:59:50,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:59:50,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:59:50,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:59:50,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:59:50,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:59:50,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:50,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf1cce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50, skipping insertion in model container [2021-12-15 08:59:50,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:50,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:59:50,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:59:50,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2021-12-15 08:59:50,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:59:50,686 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-15 08:59:50,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:59:50,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2021-12-15 08:59:50,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:59:50,825 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:59:50,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2021-12-15 08:59:50,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:59:50,918 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:59:50,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50 WrapperNode [2021-12-15 08:59:50,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:59:50,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:59:50,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:59:50,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:59:50,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:50,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,011 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 757 [2021-12-15 08:59:51,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:59:51,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:59:51,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:59:51,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:59:51,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:59:51,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:59:51,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:59:51,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:59:51,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (1/1) ... [2021-12-15 08:59:51,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:59:51,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:59:51,112 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-15 08:59:51,134 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-15 08:59:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:59:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 08:59:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 08:59:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-15 08:59:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 08:59:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 08:59:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:59:51,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:59:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-15 08:59:51,300 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:59:51,301 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:59:51,311 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-15 08:59:57,988 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-12-15 08:59:57,988 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-12-15 08:59:57,988 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:59:57,993 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:59:57,993 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 08:59:57,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:59:57 BoogieIcfgContainer [2021-12-15 08:59:57,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:59:57,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:59:57,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:59:57,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:59:57,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:59:50" (1/3) ... [2021-12-15 08:59:57,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e53c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:59:57, skipping insertion in model container [2021-12-15 08:59:57,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:59:50" (2/3) ... [2021-12-15 08:59:57,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e53c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:59:57, skipping insertion in model container [2021-12-15 08:59:57,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:59:57" (3/3) ... [2021-12-15 08:59:57,999 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2021-12-15 08:59:58,003 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:59:58,003 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:59:58,058 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:59:58,065 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-15 08:59:58,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:59:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:59:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-15 08:59:58,091 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:59:58,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:59:58,091 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:59:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:59:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2021-12-15 08:59:58,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:59:58,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300201741] [2021-12-15 08:59:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:59:58,107 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:59:58,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:59:58,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:59:58,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process