./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 791161d1 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-?-791161d [2022-07-22 11:15:14,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:15:14,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:15:14,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:15:14,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:15:14,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:15:14,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:15:14,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:15:14,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:15:14,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:15:14,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:15:14,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:15:14,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:15:14,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:15:14,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:15:14,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:15:14,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:15:14,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:15:14,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:15:14,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:15:14,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:15:14,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:15:14,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:15:14,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:15:14,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:15:14,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:15:14,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:15:14,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:15:14,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:15:14,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:15:14,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:15:14,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:15:14,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:15:14,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:15:14,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:15:14,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:15:14,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:15:14,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:15:14,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:15:14,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:15:14,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:15:14,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:15:14,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:15:14,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:15:14,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:15:14,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:15:14,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:15:14,955 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:15:14,955 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:15:14,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:15:14,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:15:14,956 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:15:14,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:15:14,956 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:15:14,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:15:14,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:15:14,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:15:14,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:15:14,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:15:14,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:15:14,958 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:15:14,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:15:14,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:15:14,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:15:14,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:15:14,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:15:14,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:15:14,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:15:14,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:15:14,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:15:14,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:15:14,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:15:14,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:15:14,961 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:15:14,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:15:14,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:15:14,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-07-22 11:15:15,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:15:15,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:15:15,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:15:15,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:15:15,180 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:15:15,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-22 11:15:15,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efdd4433/f553de5d5eb040fea1968ffa1da6452a/FLAG0220bddd2 [2022-07-22 11:15:15,711 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:15:15,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-22 11:15:15,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efdd4433/f553de5d5eb040fea1968ffa1da6452a/FLAG0220bddd2 [2022-07-22 11:15:16,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efdd4433/f553de5d5eb040fea1968ffa1da6452a [2022-07-22 11:15:16,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:15:16,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:15:16,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:15:16,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:15:16,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:15:16,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6ded9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16, skipping insertion in model container [2022-07-22 11:15:16,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:15:16,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:15:16,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-22 11:15:16,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:15:16,443 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:15:16,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-22 11:15:16,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:15:16,560 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:15:16,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16 WrapperNode [2022-07-22 11:15:16,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:15:16,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:15:16,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:15:16,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:15:16,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,636 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 788 [2022-07-22 11:15:16,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:15:16,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:15:16,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:15:16,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:15:16,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:15:16,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:15:16,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:15:16,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:15:16,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (1/1) ... [2022-07-22 11:15:16,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:15:16,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:15:16,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 11:15:16,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 11:15:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:15:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:15:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:15:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:15:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:15:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:15:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:15:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:15:16,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:15:17,028 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:15:17,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:15:17,064 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:15:19,779 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:15:19,780 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:15:19,780 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:15:19,788 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:15:19,788 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:15:19,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:15:19 BoogieIcfgContainer [2022-07-22 11:15:19,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:15:19,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:15:19,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:15:19,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:15:19,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:15:16" (1/3) ... [2022-07-22 11:15:19,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165c80a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:15:19, skipping insertion in model container [2022-07-22 11:15:19,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:16" (2/3) ... [2022-07-22 11:15:19,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165c80a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:15:19, skipping insertion in model container [2022-07-22 11:15:19,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:15:19" (3/3) ... [2022-07-22 11:15:19,801 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-07-22 11:15:19,811 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:15:19,811 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:15:19,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:15:19,858 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@642bd91e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a5563f3 [2022-07-22 11:15:19,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:15:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 11:15:19,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:19,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:19,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:19,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-07-22 11:15:19,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:19,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821241453] [2022-07-22 11:15:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:19,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:20,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821241453] [2022-07-22 11:15:20,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821241453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:20,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:20,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:20,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677492596] [2022-07-22 11:15:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:20,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:20,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:20,445 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:22,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:22,998 INFO L93 Difference]: Finished difference Result 412 states and 693 transitions. [2022-07-22 11:15:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:23,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-22 11:15:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:23,017 INFO L225 Difference]: With dead ends: 412 [2022-07-22 11:15:23,017 INFO L226 Difference]: Without dead ends: 250 [2022-07-22 11:15:23,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:23,025 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 144 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:23,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 417 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-22 11:15:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-22 11:15:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2022-07-22 11:15:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.6079545454545454) internal successors, (283), 176 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 283 transitions. [2022-07-22 11:15:23,086 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 283 transitions. Word has length 47 [2022-07-22 11:15:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:23,087 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 283 transitions. [2022-07-22 11:15:23,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 283 transitions. [2022-07-22 11:15:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 11:15:23,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:23,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:23,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:15:23,090 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:23,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1376827281, now seen corresponding path program 1 times [2022-07-22 11:15:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:23,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050067990] [2022-07-22 11:15:23,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:23,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:23,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050067990] [2022-07-22 11:15:23,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050067990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:23,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:23,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852136935] [2022-07-22 11:15:23,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:23,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:23,294 INFO L87 Difference]: Start difference. First operand 177 states and 283 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:25,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:25,598 INFO L93 Difference]: Finished difference Result 372 states and 593 transitions. [2022-07-22 11:15:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:25,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-22 11:15:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:25,600 INFO L225 Difference]: With dead ends: 372 [2022-07-22 11:15:25,600 INFO L226 Difference]: Without dead ends: 205 [2022-07-22 11:15:25,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:25,605 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 22 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:25,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 448 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:15:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-22 11:15:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2022-07-22 11:15:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6149732620320856) internal successors, (302), 187 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 302 transitions. [2022-07-22 11:15:25,619 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 302 transitions. Word has length 48 [2022-07-22 11:15:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:25,619 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 302 transitions. [2022-07-22 11:15:25,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 302 transitions. [2022-07-22 11:15:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 11:15:25,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:25,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:25,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:15:25,622 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1326962752, now seen corresponding path program 1 times [2022-07-22 11:15:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:25,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351952644] [2022-07-22 11:15:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:25,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:25,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351952644] [2022-07-22 11:15:25,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351952644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:25,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:25,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145324580] [2022-07-22 11:15:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:25,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:25,825 INFO L87 Difference]: Start difference. First operand 188 states and 302 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:27,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:28,204 INFO L93 Difference]: Finished difference Result 514 states and 830 transitions. [2022-07-22 11:15:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:28,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-22 11:15:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:28,207 INFO L225 Difference]: With dead ends: 514 [2022-07-22 11:15:28,207 INFO L226 Difference]: Without dead ends: 347 [2022-07-22 11:15:28,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:28,209 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:28,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 311 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-22 11:15:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-22 11:15:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 220. [2022-07-22 11:15:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6118721461187215) internal successors, (353), 219 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 353 transitions. [2022-07-22 11:15:28,222 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 353 transitions. Word has length 61 [2022-07-22 11:15:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:28,223 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 353 transitions. [2022-07-22 11:15:28,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 353 transitions. [2022-07-22 11:15:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:28,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:28,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:28,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:15:28,226 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1254725184, now seen corresponding path program 1 times [2022-07-22 11:15:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:28,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350064572] [2022-07-22 11:15:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:28,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:28,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350064572] [2022-07-22 11:15:28,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350064572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:28,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:28,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540066958] [2022-07-22 11:15:28,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:28,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:28,344 INFO L87 Difference]: Start difference. First operand 220 states and 353 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:30,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:30,313 INFO L93 Difference]: Finished difference Result 435 states and 694 transitions. [2022-07-22 11:15:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:30,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-22 11:15:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:30,317 INFO L225 Difference]: With dead ends: 435 [2022-07-22 11:15:30,317 INFO L226 Difference]: Without dead ends: 236 [2022-07-22 11:15:30,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:30,320 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:30,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 452 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 11:15:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-22 11:15:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2022-07-22 11:15:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6073059360730593) internal successors, (352), 219 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2022-07-22 11:15:30,337 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 62 [2022-07-22 11:15:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:30,338 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2022-07-22 11:15:30,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2022-07-22 11:15:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:30,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:30,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:30,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:15:30,348 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1693511684, now seen corresponding path program 1 times [2022-07-22 11:15:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:30,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24382785] [2022-07-22 11:15:30,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:30,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:30,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24382785] [2022-07-22 11:15:30,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24382785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:30,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:30,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278154537] [2022-07-22 11:15:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:30,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:30,480 INFO L87 Difference]: Start difference. First operand 220 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:32,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:32,858 INFO L93 Difference]: Finished difference Result 519 states and 825 transitions. [2022-07-22 11:15:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:32,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-22 11:15:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:32,864 INFO L225 Difference]: With dead ends: 519 [2022-07-22 11:15:32,864 INFO L226 Difference]: Without dead ends: 320 [2022-07-22 11:15:32,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:32,866 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:32,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 311 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-22 11:15:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-22 11:15:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 221. [2022-07-22 11:15:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5954545454545455) internal successors, (351), 220 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 351 transitions. [2022-07-22 11:15:32,884 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 351 transitions. Word has length 62 [2022-07-22 11:15:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:32,884 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 351 transitions. [2022-07-22 11:15:32,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 351 transitions. [2022-07-22 11:15:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 11:15:32,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:32,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:32,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:15:32,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:32,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1066809839, now seen corresponding path program 1 times [2022-07-22 11:15:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:32,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538530613] [2022-07-22 11:15:32,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:33,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538530613] [2022-07-22 11:15:33,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538530613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:33,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:33,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218521707] [2022-07-22 11:15:33,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:33,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:33,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:33,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:33,018 INFO L87 Difference]: Start difference. First operand 221 states and 351 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:34,337 INFO L93 Difference]: Finished difference Result 519 states and 821 transitions. [2022-07-22 11:15:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:34,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-22 11:15:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:34,339 INFO L225 Difference]: With dead ends: 519 [2022-07-22 11:15:34,339 INFO L226 Difference]: Without dead ends: 319 [2022-07-22 11:15:34,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:34,340 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:34,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-22 11:15:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-22 11:15:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-07-22 11:15:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 220 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2022-07-22 11:15:34,347 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 63 [2022-07-22 11:15:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:34,349 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2022-07-22 11:15:34,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2022-07-22 11:15:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 11:15:34,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:34,351 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:34,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:15:34,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1102657701, now seen corresponding path program 1 times [2022-07-22 11:15:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:34,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639048324] [2022-07-22 11:15:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:34,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:34,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639048324] [2022-07-22 11:15:34,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639048324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:34,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:34,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:34,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332203513] [2022-07-22 11:15:34,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:34,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:34,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:34,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:34,456 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:35,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:35,912 INFO L93 Difference]: Finished difference Result 434 states and 682 transitions. [2022-07-22 11:15:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:35,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-22 11:15:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:35,914 INFO L225 Difference]: With dead ends: 434 [2022-07-22 11:15:35,914 INFO L226 Difference]: Without dead ends: 234 [2022-07-22 11:15:35,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:35,915 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:35,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-22 11:15:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-22 11:15:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 221. [2022-07-22 11:15:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5727272727272728) internal successors, (346), 220 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2022-07-22 11:15:35,921 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 63 [2022-07-22 11:15:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:35,921 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2022-07-22 11:15:35,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2022-07-22 11:15:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 11:15:35,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:35,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:35,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:15:35,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:35,922 INFO L85 PathProgramCache]: Analyzing trace with hash -195504471, now seen corresponding path program 1 times [2022-07-22 11:15:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:35,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381980919] [2022-07-22 11:15:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:36,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:36,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381980919] [2022-07-22 11:15:36,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381980919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:36,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:36,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:36,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970188383] [2022-07-22 11:15:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:36,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:36,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:36,047 INFO L87 Difference]: Start difference. First operand 221 states and 346 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:38,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:38,344 INFO L93 Difference]: Finished difference Result 519 states and 813 transitions. [2022-07-22 11:15:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-22 11:15:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:38,346 INFO L225 Difference]: With dead ends: 519 [2022-07-22 11:15:38,346 INFO L226 Difference]: Without dead ends: 319 [2022-07-22 11:15:38,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:38,347 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:38,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:15:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-22 11:15:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-07-22 11:15:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 220 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 342 transitions. [2022-07-22 11:15:38,354 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 342 transitions. Word has length 64 [2022-07-22 11:15:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:38,356 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 342 transitions. [2022-07-22 11:15:38,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 342 transitions. [2022-07-22 11:15:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 11:15:38,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:38,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:38,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:15:38,357 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash 307896966, now seen corresponding path program 1 times [2022-07-22 11:15:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:38,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194214836] [2022-07-22 11:15:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:38,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:38,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:38,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194214836] [2022-07-22 11:15:38,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194214836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:38,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:38,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:38,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679318027] [2022-07-22 11:15:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:38,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:38,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:38,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:38,486 INFO L87 Difference]: Start difference. First operand 221 states and 342 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:40,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:40,839 INFO L93 Difference]: Finished difference Result 519 states and 806 transitions. [2022-07-22 11:15:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-22 11:15:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:40,841 INFO L225 Difference]: With dead ends: 519 [2022-07-22 11:15:40,841 INFO L226 Difference]: Without dead ends: 317 [2022-07-22 11:15:40,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:40,842 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:40,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:15:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-22 11:15:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 246. [2022-07-22 11:15:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5959183673469388) internal successors, (391), 245 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 391 transitions. [2022-07-22 11:15:40,849 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 391 transitions. Word has length 65 [2022-07-22 11:15:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:40,849 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 391 transitions. [2022-07-22 11:15:40,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 391 transitions. [2022-07-22 11:15:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-22 11:15:40,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:40,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:40,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:15:40,851 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:40,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1634406600, now seen corresponding path program 1 times [2022-07-22 11:15:40,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:40,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432396039] [2022-07-22 11:15:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:40,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 11:15:40,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:40,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432396039] [2022-07-22 11:15:40,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432396039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:40,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:40,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:40,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913144414] [2022-07-22 11:15:40,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:40,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:40,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:40,950 INFO L87 Difference]: Start difference. First operand 246 states and 391 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:42,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:43,254 INFO L93 Difference]: Finished difference Result 511 states and 814 transitions. [2022-07-22 11:15:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:43,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-22 11:15:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:43,256 INFO L225 Difference]: With dead ends: 511 [2022-07-22 11:15:43,256 INFO L226 Difference]: Without dead ends: 286 [2022-07-22 11:15:43,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:43,257 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 30 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:43,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 506 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:15:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-22 11:15:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2022-07-22 11:15:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2022-07-22 11:15:43,266 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 94 [2022-07-22 11:15:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:43,267 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2022-07-22 11:15:43,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2022-07-22 11:15:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-22 11:15:43,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:43,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:43,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:15:43,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:43,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash 217673300, now seen corresponding path program 1 times [2022-07-22 11:15:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:43,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467768790] [2022-07-22 11:15:43,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 11:15:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:43,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467768790] [2022-07-22 11:15:43,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467768790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:43,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:43,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:43,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178520049] [2022-07-22 11:15:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:43,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:43,394 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:45,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:45,615 INFO L93 Difference]: Finished difference Result 528 states and 840 transitions. [2022-07-22 11:15:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-22 11:15:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:45,616 INFO L225 Difference]: With dead ends: 528 [2022-07-22 11:15:45,617 INFO L226 Difference]: Without dead ends: 281 [2022-07-22 11:15:45,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:45,618 INFO L413 NwaCegarLoop]: 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 [2022-07-22 11:15:45,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-22 11:15:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2022-07-22 11:15:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5880149812734083) internal successors, (424), 267 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 424 transitions. [2022-07-22 11:15:45,624 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 424 transitions. Word has length 94 [2022-07-22 11:15:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:45,624 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 424 transitions. [2022-07-22 11:15:45,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 424 transitions. [2022-07-22 11:15:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-22 11:15:45,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:45,626 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:45,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:15:45,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1724300080, now seen corresponding path program 1 times [2022-07-22 11:15:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:45,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9117938] [2022-07-22 11:15:45,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:45,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 11:15:45,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:45,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9117938] [2022-07-22 11:15:45,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9117938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:45,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:45,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:45,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953257372] [2022-07-22 11:15:45,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:45,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:45,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:45,745 INFO L87 Difference]: Start difference. First operand 268 states and 424 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:47,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:47,933 INFO L93 Difference]: Finished difference Result 518 states and 826 transitions. [2022-07-22 11:15:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:47,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-22 11:15:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:47,935 INFO L225 Difference]: With dead ends: 518 [2022-07-22 11:15:47,935 INFO L226 Difference]: Without dead ends: 271 [2022-07-22 11:15:47,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:47,936 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:47,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 472 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-22 11:15:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2022-07-22 11:15:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5842696629213484) internal successors, (423), 267 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 423 transitions. [2022-07-22 11:15:47,942 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 423 transitions. Word has length 95 [2022-07-22 11:15:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:47,942 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 423 transitions. [2022-07-22 11:15:47,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 423 transitions. [2022-07-22 11:15:47,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:15:47,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:47,943 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:47,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:15:47,944 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:47,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1693697111, now seen corresponding path program 1 times [2022-07-22 11:15:47,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:47,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169344245] [2022-07-22 11:15:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 11:15:48,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:48,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169344245] [2022-07-22 11:15:48,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169344245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:48,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:48,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675542454] [2022-07-22 11:15:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:48,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:48,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:48,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:48,060 INFO L87 Difference]: Start difference. First operand 268 states and 423 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:50,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:50,279 INFO L93 Difference]: Finished difference Result 532 states and 844 transitions. [2022-07-22 11:15:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-22 11:15:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:50,281 INFO L225 Difference]: With dead ends: 532 [2022-07-22 11:15:50,281 INFO L226 Difference]: Without dead ends: 285 [2022-07-22 11:15:50,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:50,282 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:50,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-22 11:15:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 268. [2022-07-22 11:15:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5805243445692885) internal successors, (422), 267 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 422 transitions. [2022-07-22 11:15:50,289 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 422 transitions. Word has length 108 [2022-07-22 11:15:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:50,289 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 422 transitions. [2022-07-22 11:15:50,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 422 transitions. [2022-07-22 11:15:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 11:15:50,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:50,290 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:50,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:15:50,290 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:50,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash 778760430, now seen corresponding path program 1 times [2022-07-22 11:15:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:50,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999782326] [2022-07-22 11:15:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 11:15:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999782326] [2022-07-22 11:15:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999782326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:50,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:50,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793845798] [2022-07-22 11:15:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:50,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:50,387 INFO L87 Difference]: Start difference. First operand 268 states and 422 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:52,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:52,736 INFO L93 Difference]: Finished difference Result 586 states and 915 transitions. [2022-07-22 11:15:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:52,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-22 11:15:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:52,738 INFO L225 Difference]: With dead ends: 586 [2022-07-22 11:15:52,738 INFO L226 Difference]: Without dead ends: 339 [2022-07-22 11:15:52,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:52,739 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:52,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:15:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-22 11:15:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-07-22 11:15:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5655430711610487) internal successors, (418), 267 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 418 transitions. [2022-07-22 11:15:52,745 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 418 transitions. Word has length 109 [2022-07-22 11:15:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:52,746 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 418 transitions. [2022-07-22 11:15:52,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 418 transitions. [2022-07-22 11:15:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-22 11:15:52,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:52,747 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:52,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:15:52,748 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1220545399, now seen corresponding path program 1 times [2022-07-22 11:15:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:52,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703046699] [2022-07-22 11:15:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 11:15:52,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:52,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703046699] [2022-07-22 11:15:52,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703046699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:52,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:52,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:52,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467304970] [2022-07-22 11:15:52,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:52,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:52,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:52,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:52,843 INFO L87 Difference]: Start difference. First operand 268 states and 418 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:54,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:55,072 INFO L93 Difference]: Finished difference Result 586 states and 907 transitions. [2022-07-22 11:15:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-07-22 11:15:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:55,074 INFO L225 Difference]: With dead ends: 586 [2022-07-22 11:15:55,074 INFO L226 Difference]: Without dead ends: 339 [2022-07-22 11:15:55,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:55,075 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:55,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-22 11:15:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-07-22 11:15:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.550561797752809) internal successors, (414), 267 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 414 transitions. [2022-07-22 11:15:55,081 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 414 transitions. Word has length 111 [2022-07-22 11:15:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:55,082 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 414 transitions. [2022-07-22 11:15:55,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 414 transitions. [2022-07-22 11:15:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 11:15:55,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:55,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:55,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:15:55,083 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 89193371, now seen corresponding path program 1 times [2022-07-22 11:15:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:55,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395699624] [2022-07-22 11:15:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 11:15:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:55,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395699624] [2022-07-22 11:15:55,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395699624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:55,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:55,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:55,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484916728] [2022-07-22 11:15:55,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:55,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:55,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:55,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:55,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:55,218 INFO L87 Difference]: Start difference. First operand 268 states and 414 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:57,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:57,417 INFO L93 Difference]: Finished difference Result 522 states and 813 transitions. [2022-07-22 11:15:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:57,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-07-22 11:15:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:57,419 INFO L225 Difference]: With dead ends: 522 [2022-07-22 11:15:57,419 INFO L226 Difference]: Without dead ends: 275 [2022-07-22 11:15:57,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:57,420 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 26 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:57,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 492 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-22 11:15:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-07-22 11:15:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.546816479400749) internal successors, (413), 267 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 413 transitions. [2022-07-22 11:15:57,426 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 413 transitions. Word has length 112 [2022-07-22 11:15:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:57,427 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 413 transitions. [2022-07-22 11:15:57,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-07-22 11:15:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 11:15:57,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:57,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:57,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:15:57,429 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1884563494, now seen corresponding path program 1 times [2022-07-22 11:15:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:57,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823758562] [2022-07-22 11:15:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:15:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:57,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823758562] [2022-07-22 11:15:57,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823758562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:57,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:57,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592934951] [2022-07-22 11:15:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:57,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:57,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:57,527 INFO L87 Difference]: Start difference. First operand 268 states and 413 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:59,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:59,850 INFO L93 Difference]: Finished difference Result 624 states and 964 transitions. [2022-07-22 11:15:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-07-22 11:15:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:59,852 INFO L225 Difference]: With dead ends: 624 [2022-07-22 11:15:59,852 INFO L226 Difference]: Without dead ends: 377 [2022-07-22 11:15:59,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:59,853 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 116 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:59,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 325 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:15:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-22 11:15:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 300. [2022-07-22 11:15:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.5518394648829432) internal successors, (464), 299 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 464 transitions. [2022-07-22 11:15:59,861 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 464 transitions. Word has length 116 [2022-07-22 11:15:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:59,861 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 464 transitions. [2022-07-22 11:15:59,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 464 transitions. [2022-07-22 11:15:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:15:59,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:59,863 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:59,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:15:59,864 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-07-22 11:15:59,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:59,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380720201] [2022-07-22 11:15:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:15:59,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:59,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380720201] [2022-07-22 11:15:59,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380720201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:59,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:59,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984284508] [2022-07-22 11:15:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:59,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:59,974 INFO L87 Difference]: Start difference. First operand 300 states and 464 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:01,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:02,307 INFO L93 Difference]: Finished difference Result 694 states and 1072 transitions. [2022-07-22 11:16:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:02,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-22 11:16:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:02,310 INFO L225 Difference]: With dead ends: 694 [2022-07-22 11:16:02,310 INFO L226 Difference]: Without dead ends: 415 [2022-07-22 11:16:02,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:02,311 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:02,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 315 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:16:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-22 11:16:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 343. [2022-07-22 11:16:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5614035087719298) internal successors, (534), 342 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 534 transitions. [2022-07-22 11:16:02,319 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 534 transitions. Word has length 127 [2022-07-22 11:16:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:02,319 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 534 transitions. [2022-07-22 11:16:02,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 534 transitions. [2022-07-22 11:16:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:02,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:02,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:02,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:16:02,322 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1658817010, now seen corresponding path program 1 times [2022-07-22 11:16:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:02,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539338404] [2022-07-22 11:16:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-22 11:16:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:02,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539338404] [2022-07-22 11:16:02,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539338404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:02,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:02,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080536144] [2022-07-22 11:16:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:02,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:02,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:02,469 INFO L87 Difference]: Start difference. First operand 343 states and 534 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:02,495 INFO L93 Difference]: Finished difference Result 987 states and 1552 transitions. [2022-07-22 11:16:02,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:02,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-22 11:16:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:02,499 INFO L225 Difference]: With dead ends: 987 [2022-07-22 11:16:02,499 INFO L226 Difference]: Without dead ends: 665 [2022-07-22 11:16:02,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:02,500 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 143 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:02,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 558 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:16:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-22 11:16:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2022-07-22 11:16:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.566465256797583) internal successors, (1037), 662 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1037 transitions. [2022-07-22 11:16:02,531 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1037 transitions. Word has length 127 [2022-07-22 11:16:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:02,531 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1037 transitions. [2022-07-22 11:16:02,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1037 transitions. [2022-07-22 11:16:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:02,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:02,533 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:02,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:16:02,534 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:02,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash -390570832, now seen corresponding path program 1 times [2022-07-22 11:16:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:02,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645090770] [2022-07-22 11:16:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:16:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:02,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645090770] [2022-07-22 11:16:02,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645090770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:02,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:02,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439724417] [2022-07-22 11:16:02,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:02,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:02,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:02,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:02,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:02,638 INFO L87 Difference]: Start difference. First operand 663 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:02,665 INFO L93 Difference]: Finished difference Result 1580 states and 2483 transitions. [2022-07-22 11:16:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:02,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-22 11:16:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:02,669 INFO L225 Difference]: With dead ends: 1580 [2022-07-22 11:16:02,669 INFO L226 Difference]: Without dead ends: 938 [2022-07-22 11:16:02,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:02,671 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 138 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:02,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 431 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:16:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-22 11:16:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2022-07-22 11:16:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 1.5635005336179295) internal successors, (1465), 937 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1465 transitions. [2022-07-22 11:16:02,692 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1465 transitions. Word has length 127 [2022-07-22 11:16:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:02,693 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1465 transitions. [2022-07-22 11:16:02,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1465 transitions. [2022-07-22 11:16:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:02,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:02,695 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:02,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:16:02,696 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1945821678, now seen corresponding path program 1 times [2022-07-22 11:16:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:02,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24874891] [2022-07-22 11:16:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-22 11:16:02,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24874891] [2022-07-22 11:16:02,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24874891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:02,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:02,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306974452] [2022-07-22 11:16:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:02,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:02,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:02,790 INFO L87 Difference]: Start difference. First operand 938 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:02,812 INFO L93 Difference]: Finished difference Result 1882 states and 2942 transitions. [2022-07-22 11:16:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:02,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-22 11:16:02,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:02,816 INFO L225 Difference]: With dead ends: 1882 [2022-07-22 11:16:02,816 INFO L226 Difference]: Without dead ends: 965 [2022-07-22 11:16:02,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:02,820 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:02,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 404 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:16:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-07-22 11:16:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2022-07-22 11:16:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.5560165975103735) internal successors, (1500), 964 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1500 transitions. [2022-07-22 11:16:02,840 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1500 transitions. Word has length 127 [2022-07-22 11:16:02,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:02,840 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1500 transitions. [2022-07-22 11:16:02,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1500 transitions. [2022-07-22 11:16:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:02,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:02,843 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:02,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:16:02,843 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1322540076, now seen corresponding path program 1 times [2022-07-22 11:16:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:02,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337430394] [2022-07-22 11:16:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-22 11:16:02,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:02,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337430394] [2022-07-22 11:16:02,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337430394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:02,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:02,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:02,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341000977] [2022-07-22 11:16:02,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:02,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:02,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:02,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:02,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:02,928 INFO L87 Difference]: Start difference. First operand 965 states and 1500 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:02,944 INFO L93 Difference]: Finished difference Result 1591 states and 2470 transitions. [2022-07-22 11:16:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:02,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-22 11:16:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:02,947 INFO L225 Difference]: With dead ends: 1591 [2022-07-22 11:16:02,947 INFO L226 Difference]: Without dead ends: 647 [2022-07-22 11:16:02,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:02,951 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:02,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:16:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-22 11:16:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-22 11:16:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5386996904024768) internal successors, (994), 646 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 994 transitions. [2022-07-22 11:16:02,963 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 994 transitions. Word has length 127 [2022-07-22 11:16:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:02,964 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 994 transitions. [2022-07-22 11:16:02,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 994 transitions. [2022-07-22 11:16:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-22 11:16:02,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:02,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:02,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:16:02,966 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash -116280318, now seen corresponding path program 1 times [2022-07-22 11:16:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:02,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699919108] [2022-07-22 11:16:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-22 11:16:03,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:03,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699919108] [2022-07-22 11:16:03,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699919108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:03,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:03,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:16:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286737162] [2022-07-22 11:16:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:03,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:16:03,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:03,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:16:03,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:03,341 INFO L87 Difference]: Start difference. First operand 647 states and 994 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:05,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:07,377 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 [] [2022-07-22 11:16:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:07,643 INFO L93 Difference]: Finished difference Result 1291 states and 1984 transitions. [2022-07-22 11:16:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:16:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-07-22 11:16:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:07,646 INFO L225 Difference]: With dead ends: 1291 [2022-07-22 11:16:07,646 INFO L226 Difference]: Without dead ends: 647 [2022-07-22 11:16:07,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:16:07,647 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:07,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:16:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-22 11:16:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-22 11:16:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5371517027863777) internal successors, (993), 646 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 993 transitions. [2022-07-22 11:16:07,662 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 993 transitions. Word has length 128 [2022-07-22 11:16:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:07,663 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 993 transitions. [2022-07-22 11:16:07,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 993 transitions. [2022-07-22 11:16:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-22 11:16:07,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:07,665 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:07,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 11:16:07,665 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-07-22 11:16:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:07,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893035668] [2022-07-22 11:16:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:08,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:16:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:08,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:16:08,379 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:16:08,380 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:16:08,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 11:16:08,386 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:08,389 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:16:08,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:16:08 BoogieIcfgContainer [2022-07-22 11:16:08,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:16:08,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:16:08,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:16:08,513 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:16:08,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:15:19" (3/4) ... [2022-07-22 11:16:08,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 11:16:08,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:16:08,516 INFO L158 Benchmark]: Toolchain (without parser) took 52490.84ms. Allocated memory was 86.0MB in the beginning and 132.1MB in the end (delta: 46.1MB). Free memory was 48.0MB in the beginning and 32.9MB in the end (delta: 15.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2022-07-22 11:16:08,517 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 67.0MB in the beginning and 66.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:16:08,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.34ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 47.8MB in the beginning and 64.9MB in the end (delta: -17.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-22 11:16:08,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.87ms. Allocated memory is still 109.1MB. Free memory was 64.9MB in the beginning and 60.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:16:08,517 INFO L158 Benchmark]: Boogie Preprocessor took 108.76ms. Allocated memory is still 109.1MB. Free memory was 60.0MB in the beginning and 52.8MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 11:16:08,518 INFO L158 Benchmark]: RCFGBuilder took 3035.67ms. Allocated memory is still 109.1MB. Free memory was 52.8MB in the beginning and 50.2MB in the end (delta: 2.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-07-22 11:16:08,518 INFO L158 Benchmark]: TraceAbstraction took 48718.25ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 49.5MB in the beginning and 32.9MB in the end (delta: 16.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-07-22 11:16:08,518 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 132.1MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:16:08,519 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 67.0MB in the beginning and 66.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.34ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 47.8MB in the beginning and 64.9MB in the end (delta: -17.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.87ms. Allocated memory is still 109.1MB. Free memory was 64.9MB in the beginning and 60.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.76ms. Allocated memory is still 109.1MB. Free memory was 60.0MB in the beginning and 52.8MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3035.67ms. Allocated memory is still 109.1MB. Free memory was 52.8MB in the beginning and 50.2MB in the end (delta: 2.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 48718.25ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 49.5MB in the beginning and 32.9MB in the end (delta: 16.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 132.1MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=0, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0, tmp___9=8] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1618] COND TRUE blastFlag == 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1737] reach_error() VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 1815 SdHoareTripleChecker+Valid, 43.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1815 mSDsluCounter, 9467 SdHoareTripleChecker+Invalid, 41.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5584 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4001 IncrementalHoareTripleChecker+Invalid, 4664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 3883 mSDtfsCounter, 4001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=21, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 963 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2265 NumberOfCodeBlocks, 2265 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1192/1192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 11:16:08,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-?-791161d [2022-07-22 11:16:10,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:16:10,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:16:10,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:16:10,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:16:10,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:16:10,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:16:10,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:16:10,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:16:10,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:16:10,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:16:10,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:16:10,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:16:10,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:16:10,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:16:10,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:16:10,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:16:10,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:16:10,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:16:10,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:16:10,362 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:16:10,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:16:10,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:16:10,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:16:10,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:16:10,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:16:10,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:16:10,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:16:10,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:16:10,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:16:10,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:16:10,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:16:10,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:16:10,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:16:10,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:16:10,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:16:10,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:16:10,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:16:10,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:16:10,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:16:10,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:16:10,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:16:10,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 11:16:10,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:16:10,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:16:10,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:16:10,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:16:10,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:16:10,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:16:10,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:16:10,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:16:10,415 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:16:10,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:16:10,421 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:16:10,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:16:10,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:16:10,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:16:10,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:16:10,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:16:10,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 11:16:10,423 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 11:16:10,423 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 11:16:10,423 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:16:10,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:16:10,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:16:10,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:16:10,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:16:10,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:16:10,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:16:10,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:16:10,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:16:10,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:16:10,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:16:10,425 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 11:16:10,425 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 11:16:10,426 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:16:10,426 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:16:10,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:16:10,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 11:16:10,427 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-07-22 11:16:10,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:16:10,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:16:10,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:16:10,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:16:10,770 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:16:10,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-22 11:16:10,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b3f1538/5bc82c0038104e7a815e9f1402d416e7/FLAGd32095855 [2022-07-22 11:16:11,373 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:16:11,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-22 11:16:11,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b3f1538/5bc82c0038104e7a815e9f1402d416e7/FLAGd32095855 [2022-07-22 11:16:11,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b3f1538/5bc82c0038104e7a815e9f1402d416e7 [2022-07-22 11:16:11,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:16:11,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:16:11,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:16:11,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:16:11,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:16:11,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:16:11" (1/1) ... [2022-07-22 11:16:11,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217e99f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:11, skipping insertion in model container [2022-07-22 11:16:11,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:16:11" (1/1) ... [2022-07-22 11:16:11,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:16:11,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:16:12,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-22 11:16:12,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:12,261 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 11:16:12,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:16:12,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-22 11:16:12,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:12,355 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:16:12,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-22 11:16:12,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:12,455 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:16:12,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12 WrapperNode [2022-07-22 11:16:12,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:16:12,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:16:12,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:16:12,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:16:12,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,530 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 757 [2022-07-22 11:16:12,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:16:12,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:16:12,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:16:12,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:16:12,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:16:12,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:16:12,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:16:12,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:16:12,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (1/1) ... [2022-07-22 11:16:12,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:16:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:16:12,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 11:16:12,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 11:16:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:16:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 11:16:12,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:16:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 11:16:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:16:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:16:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:16:12,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:16:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 11:16:12,938 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:16:12,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:16:12,959 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:16:19,501 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:16:19,502 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:16:19,502 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:16:19,508 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:16:19,508 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:16:19,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:16:19 BoogieIcfgContainer [2022-07-22 11:16:19,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:16:19,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:16:19,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:16:19,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:16:19,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:16:11" (1/3) ... [2022-07-22 11:16:19,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301bcc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:16:19, skipping insertion in model container [2022-07-22 11:16:19,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:12" (2/3) ... [2022-07-22 11:16:19,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301bcc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:16:19, skipping insertion in model container [2022-07-22 11:16:19,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:16:19" (3/3) ... [2022-07-22 11:16:19,517 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-07-22 11:16:19,528 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:16:19,528 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:16:19,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:16:19,570 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b97984, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1fc8074c [2022-07-22 11:16:19,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:16:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 11:16:19,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:19,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:19,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-07-22 11:16:19,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:19,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824086647] [2022-07-22 11:16:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:19,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:19,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:19,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:16:19,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 11:16:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:20,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:20,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:16:20,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:20,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:20,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824086647] [2022-07-22 11:16:20,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824086647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:20,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:20,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250713125] [2022-07-22 11:16:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:20,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:20,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:20,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:20,402 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:20,525 INFO L93 Difference]: Finished difference Result 418 states and 704 transitions. [2022-07-22 11:16:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:20,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-22 11:16:20,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:20,541 INFO L225 Difference]: With dead ends: 418 [2022-07-22 11:16:20,542 INFO L226 Difference]: Without dead ends: 255 [2022-07-22 11:16:20,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:20,547 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 187 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:20,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 457 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:16:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-22 11:16:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-07-22 11:16:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.5118110236220472) internal successors, (384), 254 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 384 transitions. [2022-07-22 11:16:20,592 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 384 transitions. Word has length 47 [2022-07-22 11:16:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:20,593 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 384 transitions. [2022-07-22 11:16:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 384 transitions. [2022-07-22 11:16:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 11:16:20,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:20,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:20,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 11:16:20,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:16:20,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -682574659, now seen corresponding path program 1 times [2022-07-22 11:16:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:20,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917201108] [2022-07-22 11:16:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:20,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:20,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:16:20,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 11:16:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:21,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:21,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:16:21,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:21,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:21,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917201108] [2022-07-22 11:16:21,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917201108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:21,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:21,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:21,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441212905] [2022-07-22 11:16:21,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:21,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:21,495 INFO L87 Difference]: Start difference. First operand 255 states and 384 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:21,615 INFO L93 Difference]: Finished difference Result 498 states and 757 transitions. [2022-07-22 11:16:21,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:21,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-22 11:16:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:21,618 INFO L225 Difference]: With dead ends: 498 [2022-07-22 11:16:21,618 INFO L226 Difference]: Without dead ends: 374 [2022-07-22 11:16:21,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:21,620 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:21,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 562 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:16:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-22 11:16:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-07-22 11:16:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.5067024128686326) internal successors, (562), 373 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 562 transitions. [2022-07-22 11:16:21,651 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 562 transitions. Word has length 64 [2022-07-22 11:16:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:21,651 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 562 transitions. [2022-07-22 11:16:21,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 562 transitions. [2022-07-22 11:16:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 11:16:21,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:21,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:21,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 11:16:21,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:16:21,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 485035231, now seen corresponding path program 1 times [2022-07-22 11:16:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:21,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431588285] [2022-07-22 11:16:21,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:21,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:21,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:21,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:16:21,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 11:16:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:22,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:22,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:16:22,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:22,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:22,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431588285] [2022-07-22 11:16:22,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431588285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:22,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:22,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:22,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754937792] [2022-07-22 11:16:22,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:22,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:22,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:22,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:22,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:22,603 INFO L87 Difference]: Start difference. First operand 374 states and 562 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:22,710 INFO L93 Difference]: Finished difference Result 737 states and 1115 transitions. [2022-07-22 11:16:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-22 11:16:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:22,713 INFO L225 Difference]: With dead ends: 737 [2022-07-22 11:16:22,713 INFO L226 Difference]: Without dead ends: 494 [2022-07-22 11:16:22,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:22,715 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:22,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 566 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:16:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-07-22 11:16:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2022-07-22 11:16:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.5050709939148073) internal successors, (742), 493 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 742 transitions. [2022-07-22 11:16:22,735 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 742 transitions. Word has length 86 [2022-07-22 11:16:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:22,736 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 742 transitions. [2022-07-22 11:16:22,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 742 transitions. [2022-07-22 11:16:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:22,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:22,741 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:22,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:16:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:16:22,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-07-22 11:16:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:22,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651873332] [2022-07-22 11:16:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:22,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:22,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:22,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:16:22,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 11:16:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:23,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:23,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-22 11:16:23,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:23,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651873332] [2022-07-22 11:16:23,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651873332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:23,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:23,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571334429] [2022-07-22 11:16:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:23,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:23,738 INFO L87 Difference]: Start difference. First operand 494 states and 742 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:23,830 INFO L93 Difference]: Finished difference Result 854 states and 1285 transitions. [2022-07-22 11:16:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:23,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-22 11:16:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:23,833 INFO L225 Difference]: With dead ends: 854 [2022-07-22 11:16:23,833 INFO L226 Difference]: Without dead ends: 491 [2022-07-22 11:16:23,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:23,835 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 138 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:23,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 561 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:16:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-22 11:16:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-22 11:16:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.493877551020408) internal successors, (732), 490 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 732 transitions. [2022-07-22 11:16:23,846 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 732 transitions. Word has length 127 [2022-07-22 11:16:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:23,846 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 732 transitions. [2022-07-22 11:16:23,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 732 transitions. [2022-07-22 11:16:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-22 11:16:23,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:23,848 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:23,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:16:24,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:16:24,062 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:24,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:24,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1760202500, now seen corresponding path program 1 times [2022-07-22 11:16:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:24,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478917072] [2022-07-22 11:16:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:24,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:24,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:24,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:16:24,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 11:16:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:25,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 11:16:25,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:25,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 11:16:25,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 11:16:25,688 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-22 11:16:25,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 58 treesize of output 85 [2022-07-22 11:16:25,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2022-07-22 11:16:25,970 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-22 11:16:25,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-22 11:16:25,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:25,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:26,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:26,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:26,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:26,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:26,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-22 11:16:26,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 11:16:26,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 11:16:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-22 11:16:26,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:26,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:26,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478917072] [2022-07-22 11:16:26,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478917072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:26,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:26,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:16:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537303346] [2022-07-22 11:16:26,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:26,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:16:26,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:26,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:16:26,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:26,067 INFO L87 Difference]: Start difference. First operand 491 states and 732 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:28,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:30,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:35,991 INFO L93 Difference]: Finished difference Result 979 states and 1460 transitions. [2022-07-22 11:16:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:16:35,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-07-22 11:16:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:35,995 INFO L225 Difference]: With dead ends: 979 [2022-07-22 11:16:35,995 INFO L226 Difference]: Without dead ends: 491 [2022-07-22 11:16:35,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:16:35,997 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:35,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2022-07-22 11:16:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-22 11:16:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-22 11:16:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4918367346938775) internal successors, (731), 490 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 731 transitions. [2022-07-22 11:16:36,009 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 731 transitions. Word has length 128 [2022-07-22 11:16:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:36,010 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 731 transitions. [2022-07-22 11:16:36,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 731 transitions. [2022-07-22 11:16:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-22 11:16:36,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:36,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:36,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 11:16:36,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:16:36,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:36,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1330544194, now seen corresponding path program 1 times [2022-07-22 11:16:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:36,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958285948] [2022-07-22 11:16:36,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:36,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:36,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:36,229 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:16:36,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 11:16:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:37,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 11:16:37,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:37,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 11:16:37,528 INFO L356 Elim1Store]: treesize reduction 190, result has 12.8 percent of original size [2022-07-22 11:16:37,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 38 [2022-07-22 11:16:37,862 INFO L356 Elim1Store]: treesize reduction 825, result has 7.2 percent of original size [2022-07-22 11:16:37,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 86 [2022-07-22 11:16:38,259 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 11:16:38,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 23 [2022-07-22 11:16:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 11:16:38,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:38,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:38,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958285948] [2022-07-22 11:16:38,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958285948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:38,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:38,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900834845] [2022-07-22 11:16:38,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:38,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:38,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:38,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:38,280 INFO L87 Difference]: Start difference. First operand 491 states and 731 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:40,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:43,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:47,668 INFO L93 Difference]: Finished difference Result 1122 states and 1671 transitions. [2022-07-22 11:16:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:47,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-07-22 11:16:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:47,676 INFO L225 Difference]: With dead ends: 1122 [2022-07-22 11:16:47,676 INFO L226 Difference]: Without dead ends: 641 [2022-07-22 11:16:47,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:47,677 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 39 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:47,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 566 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2022-07-22 11:16:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-22 11:16:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 566. [2022-07-22 11:16:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.5221238938053097) internal successors, (860), 565 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 860 transitions. [2022-07-22 11:16:47,693 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 860 transitions. Word has length 128 [2022-07-22 11:16:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:47,693 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 860 transitions. [2022-07-22 11:16:47,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 860 transitions. [2022-07-22 11:16:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-22 11:16:47,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:47,696 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:47,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 11:16:47,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:16:47,909 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-07-22 11:16:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:47,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724331377] [2022-07-22 11:16:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:47,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:16:47,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 11:16:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:52,791 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:16:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:54,377 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-22 11:16:54,379 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:16:54,380 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:16:54,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-22 11:16:54,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:16:54,590 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:54,594 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:16:54,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:16:54 BoogieIcfgContainer [2022-07-22 11:16:54,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:16:54,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:16:54,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:16:54,747 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:16:54,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:16:19" (3/4) ... [2022-07-22 11:16:54,749 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 11:16:54,848 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:16:54,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:16:54,849 INFO L158 Benchmark]: Toolchain (without parser) took 43035.62ms. Allocated memory was 73.4MB in the beginning and 117.4MB in the end (delta: 44.0MB). Free memory was 54.4MB in the beginning and 49.8MB in the end (delta: 4.5MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,849 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:16:54,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.63ms. Allocated memory is still 73.4MB. Free memory was 54.0MB in the beginning and 43.0MB in the end (delta: 11.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.97ms. Allocated memory is still 73.4MB. Free memory was 43.0MB in the beginning and 38.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,850 INFO L158 Benchmark]: Boogie Preprocessor took 110.13ms. Allocated memory is still 73.4MB. Free memory was 38.4MB in the beginning and 31.0MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,851 INFO L158 Benchmark]: RCFGBuilder took 6868.65ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 31.0MB in the beginning and 52.1MB in the end (delta: -21.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,851 INFO L158 Benchmark]: TraceAbstraction took 35234.95ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 51.5MB in the beginning and 66.6MB in the end (delta: -15.1MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,851 INFO L158 Benchmark]: Witness Printer took 101.43ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 49.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 639.63ms. Allocated memory is still 73.4MB. Free memory was 54.0MB in the beginning and 43.0MB in the end (delta: 11.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.97ms. Allocated memory is still 73.4MB. Free memory was 43.0MB in the beginning and 38.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.13ms. Allocated memory is still 73.4MB. Free memory was 38.4MB in the beginning and 31.0MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 6868.65ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 31.0MB in the beginning and 52.1MB in the end (delta: -21.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35234.95ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 51.5MB in the beginning and 66.6MB in the end (delta: -15.1MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Witness Printer took 101.43ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 49.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1737]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->cert={6:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=0, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1383] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___9=2147483648] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1618] COND TRUE blastFlag == 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1737] reach_error() VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.0s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 645 mSDsluCounter, 3347 SdHoareTripleChecker+Invalid, 19.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1789 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 75 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 1718 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4568 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 359/359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-22 11:16:54,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE