./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.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.04.i.cil.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 77bf68ba948969a1221675397215385a80fe998a5bd74b2516bc1a677cd2e8b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:15:28,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:15:28,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:15:28,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:15:28,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:15:28,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:15:28,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:15:28,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:15:28,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:15:28,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:15:28,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:15:28,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:15:28,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:15:28,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:15:28,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:15:29,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:15:29,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:15:29,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:15:29,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:15:29,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:15:29,009 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:15:29,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:15:29,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:15:29,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:15:29,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:15:29,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:15:29,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:15:29,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:15:29,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:15:29,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:15:29,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:15:29,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:15:29,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:15:29,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:15:29,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:15:29,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:15:29,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:15:29,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:15:29,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:15:29,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:15:29,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:15:29,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:15:29,026 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:29,045 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:15:29,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:15:29,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:15:29,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:15:29,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:15:29,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:15:29,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:15:29,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:15:29,047 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:15:29,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:15:29,048 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:15:29,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:15:29,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:15:29,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:15:29,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:15:29,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:15:29,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:15:29,049 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:15:29,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:15:29,049 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:15:29,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:15:29,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:15:29,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:15:29,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:15:29,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:15:29,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:15:29,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:15:29,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:15:29,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:15:29,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:15:29,051 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:15:29,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:15:29,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:15:29,052 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 -> 77bf68ba948969a1221675397215385a80fe998a5bd74b2516bc1a677cd2e8b7 [2022-07-22 11:15:29,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:15:29,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:15:29,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:15:29,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:15:29,215 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:15:29,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2022-07-22 11:15:29,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920370b2b/5d49e927d22d4ef0b8df441a07c8ee94/FLAGc5d29070c [2022-07-22 11:15:29,706 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:15:29,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2022-07-22 11:15:29,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920370b2b/5d49e927d22d4ef0b8df441a07c8ee94/FLAGc5d29070c [2022-07-22 11:15:29,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920370b2b/5d49e927d22d4ef0b8df441a07c8ee94 [2022-07-22 11:15:29,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:15:29,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:15:29,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:15:29,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:15:29,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:15:29,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:15:29" (1/1) ... [2022-07-22 11:15:29,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0a3183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:29, skipping insertion in model container [2022-07-22 11:15:29,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:15:29" (1/1) ... [2022-07-22 11:15:29,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:15:29,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:15:30,061 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.04.i.cil.c[72500,72513] [2022-07-22 11:15:30,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:15:30,106 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:15:30,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[72500,72513] [2022-07-22 11:15:30,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:15:30,236 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:15:30,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:30 WrapperNode [2022-07-22 11:15:30,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:15:30,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:15:30,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:15:30,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:15:30,243 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:30" (1/1) ... [2022-07-22 11:15:30,266 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:30" (1/1) ... [2022-07-22 11:15:30,313 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 782 [2022-07-22 11:15:30,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:15:30,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:15:30,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:15:30,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:15:30,321 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:30" (1/1) ... [2022-07-22 11:15:30,322 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:30" (1/1) ... [2022-07-22 11:15:30,336 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:30" (1/1) ... [2022-07-22 11:15:30,336 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:30" (1/1) ... [2022-07-22 11:15:30,401 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:30" (1/1) ... [2022-07-22 11:15:30,406 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:30" (1/1) ... [2022-07-22 11:15:30,408 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:30" (1/1) ... [2022-07-22 11:15:30,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:15:30,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:15:30,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:15:30,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:15:30,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:30" (1/1) ... [2022-07-22 11:15:30,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:15:30,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:15:30,467 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:30,472 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:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:15:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:15:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:15:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:15:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:15:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:15:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:15:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:15:30,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:15:30,602 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:15:30,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:15:30,617 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:15:33,172 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:15:33,173 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:15:33,173 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:15:33,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:15:33,182 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:15:33,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:15:33 BoogieIcfgContainer [2022-07-22 11:15:33,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:15:33,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:15:33,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:15:33,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:15:33,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:15:29" (1/3) ... [2022-07-22 11:15:33,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33be3cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:15:33, skipping insertion in model container [2022-07-22 11:15:33,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:30" (2/3) ... [2022-07-22 11:15:33,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33be3cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:15:33, skipping insertion in model container [2022-07-22 11:15:33,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:15:33" (3/3) ... [2022-07-22 11:15:33,193 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2022-07-22 11:15:33,204 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:15:33,204 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:15:33,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:15:33,259 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@54414f4d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3945be4d [2022-07-22 11:15:33,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:15:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 11:15:33,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:33,271 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:33,271 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:33,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:33,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1430118927, now seen corresponding path program 1 times [2022-07-22 11:15:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:33,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059454332] [2022-07-22 11:15:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:33,762 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:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:33,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059454332] [2022-07-22 11:15:33,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059454332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:33,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:33,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363022926] [2022-07-22 11:15:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:33,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:33,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:33,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:33,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:33,797 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:35,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:35,966 INFO L93 Difference]: Finished difference Result 405 states and 685 transitions. [2022-07-22 11:15:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:35,970 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:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:35,978 INFO L225 Difference]: With dead ends: 405 [2022-07-22 11:15:35,978 INFO L226 Difference]: Without dead ends: 245 [2022-07-22 11:15:35,980 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,982 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 140 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:35,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 411 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 11:15:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-22 11:15:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 175. [2022-07-22 11:15:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.6091954022988506) internal successors, (280), 174 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2022-07-22 11:15:36,013 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 47 [2022-07-22 11:15:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:36,014 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2022-07-22 11:15:36,014 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:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2022-07-22 11:15:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 11:15:36,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:36,016 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:36,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:15:36,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1376829262, now seen corresponding path program 1 times [2022-07-22 11:15:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:36,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608653388] [2022-07-22 11:15:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:36,122 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:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:36,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608653388] [2022-07-22 11:15:36,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608653388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:36,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:36,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:36,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195571187] [2022-07-22 11:15:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:36,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:36,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:36,125 INFO L87 Difference]: Start difference. First operand 175 states and 280 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:37,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:38,090 INFO L93 Difference]: Finished difference Result 368 states and 587 transitions. [2022-07-22 11:15:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:38,090 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:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:38,092 INFO L225 Difference]: With dead ends: 368 [2022-07-22 11:15:38,092 INFO L226 Difference]: Without dead ends: 203 [2022-07-22 11:15:38,092 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,093 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 22 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:38,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 439 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-22 11:15:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-22 11:15:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-22 11:15:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6162162162162161) internal successors, (299), 185 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 299 transitions. [2022-07-22 11:15:38,114 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 299 transitions. Word has length 48 [2022-07-22 11:15:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:38,114 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 299 transitions. [2022-07-22 11:15:38,114 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:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 299 transitions. [2022-07-22 11:15:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 11:15:38,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:38,116 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:38,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:15:38,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1875534592, now seen corresponding path program 1 times [2022-07-22 11:15:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:38,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510405197] [2022-07-22 11:15:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:38,237 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:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:38,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510405197] [2022-07-22 11:15:38,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510405197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:38,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:38,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659527749] [2022-07-22 11:15:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:38,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:38,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:38,240 INFO L87 Difference]: Start difference. First operand 186 states and 299 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:40,249 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:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:40,438 INFO L93 Difference]: Finished difference Result 368 states and 586 transitions. [2022-07-22 11:15:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:40,439 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:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:40,440 INFO L225 Difference]: With dead ends: 368 [2022-07-22 11:15:40,440 INFO L226 Difference]: Without dead ends: 203 [2022-07-22 11:15:40,440 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:40,441 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 24 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:40,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 441 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-22 11:15:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-22 11:15:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6108108108108108) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2022-07-22 11:15:40,449 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 298 transitions. Word has length 61 [2022-07-22 11:15:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:40,449 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-07-22 11:15:40,449 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:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 298 transitions. [2022-07-22 11:15:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:40,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:40,451 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] [2022-07-22 11:15:40,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:15:40,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1839351473, now seen corresponding path program 1 times [2022-07-22 11:15:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:40,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910542097] [2022-07-22 11:15:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:40,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:40,569 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:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:40,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910542097] [2022-07-22 11:15:40,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910542097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:40,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:40,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:40,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152486975] [2022-07-22 11:15:40,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:40,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:40,576 INFO L87 Difference]: Start difference. First operand 186 states and 298 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:42,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:42,758 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-07-22 11:15:42,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:42,758 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:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:42,759 INFO L225 Difference]: With dead ends: 367 [2022-07-22 11:15:42,759 INFO L226 Difference]: Without dead ends: 202 [2022-07-22 11:15:42,760 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:42,760 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 28 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:42,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 443 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-22 11:15:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-22 11:15:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6054054054054054) internal successors, (297), 185 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 297 transitions. [2022-07-22 11:15:42,766 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 297 transitions. Word has length 62 [2022-07-22 11:15:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:42,766 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 297 transitions. [2022-07-22 11:15:42,766 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:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 297 transitions. [2022-07-22 11:15:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:42,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:42,770 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] [2022-07-22 11:15:42,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:15:42,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1630821317, now seen corresponding path program 1 times [2022-07-22 11:15:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:42,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661780146] [2022-07-22 11:15:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:42,891 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:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661780146] [2022-07-22 11:15:42,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661780146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:42,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:42,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554991903] [2022-07-22 11:15:42,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:42,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:42,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:42,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:42,894 INFO L87 Difference]: Start difference. First operand 186 states and 297 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:44,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:44,458 INFO L93 Difference]: Finished difference Result 367 states and 583 transitions. [2022-07-22 11:15:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:44,459 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:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:44,460 INFO L225 Difference]: With dead ends: 367 [2022-07-22 11:15:44,460 INFO L226 Difference]: Without dead ends: 202 [2022-07-22 11:15:44,460 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:44,461 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 26 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:44,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 443 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 11:15:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-22 11:15:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-22 11:15:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 296 transitions. [2022-07-22 11:15:44,466 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 296 transitions. Word has length 62 [2022-07-22 11:15:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:44,466 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 296 transitions. [2022-07-22 11:15:44,466 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:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 296 transitions. [2022-07-22 11:15:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:44,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:44,472 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:44,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:15:44,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash 509961732, now seen corresponding path program 1 times [2022-07-22 11:15:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:44,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453914657] [2022-07-22 11:15:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:44,620 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:44,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:44,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453914657] [2022-07-22 11:15:44,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453914657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:44,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:44,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:44,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302982299] [2022-07-22 11:15:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:44,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:44,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:44,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:44,622 INFO L87 Difference]: Start difference. First operand 186 states and 296 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:46,635 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:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:46,816 INFO L93 Difference]: Finished difference Result 366 states and 581 transitions. [2022-07-22 11:15:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:46,816 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:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:46,817 INFO L225 Difference]: With dead ends: 366 [2022-07-22 11:15:46,817 INFO L226 Difference]: Without dead ends: 201 [2022-07-22 11:15:46,817 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:46,818 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 19 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:46,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 445 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-22 11:15:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2022-07-22 11:15:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5945945945945945) internal successors, (295), 185 states have internal predecessors, (295), 0 states have call successors, (0), 0 states 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:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 295 transitions. [2022-07-22 11:15:46,823 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 295 transitions. Word has length 62 [2022-07-22 11:15:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:46,823 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 295 transitions. [2022-07-22 11:15:46,823 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:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 295 transitions. [2022-07-22 11:15:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:46,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:46,824 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:46,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:15:46,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1144939844, now seen corresponding path program 1 times [2022-07-22 11:15:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:46,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427860514] [2022-07-22 11:15:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:46,914 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:46,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:46,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427860514] [2022-07-22 11:15:46,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427860514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:46,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:46,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:46,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831657960] [2022-07-22 11:15:46,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:46,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:46,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:46,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:46,916 INFO L87 Difference]: Start difference. First operand 186 states and 295 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:48,932 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:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:49,162 INFO L93 Difference]: Finished difference Result 364 states and 578 transitions. [2022-07-22 11:15:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:49,162 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:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:49,164 INFO L225 Difference]: With dead ends: 364 [2022-07-22 11:15:49,165 INFO L226 Difference]: Without dead ends: 199 [2022-07-22 11:15:49,165 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:49,167 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 449 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:49,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 449 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:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-22 11:15:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-22 11:15:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5891891891891892) internal successors, (294), 185 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 294 transitions. [2022-07-22 11:15:49,178 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 294 transitions. Word has length 62 [2022-07-22 11:15:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:49,179 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 294 transitions. [2022-07-22 11:15:49,180 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:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 294 transitions. [2022-07-22 11:15:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 11:15:49,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:49,183 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] [2022-07-22 11:15:49,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:15:49,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1652438455, now seen corresponding path program 1 times [2022-07-22 11:15:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:49,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309799439] [2022-07-22 11:15:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:49,262 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:49,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:49,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309799439] [2022-07-22 11:15:49,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309799439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:49,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:49,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258257229] [2022-07-22 11:15:49,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:49,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:49,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:49,265 INFO L87 Difference]: Start difference. First operand 186 states and 294 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:51,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:51,455 INFO L93 Difference]: Finished difference Result 364 states and 577 transitions. [2022-07-22 11:15:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:51,456 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:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:51,458 INFO L225 Difference]: With dead ends: 364 [2022-07-22 11:15:51,458 INFO L226 Difference]: Without dead ends: 199 [2022-07-22 11:15:51,458 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:51,459 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 22 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 449 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:51,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 449 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:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-22 11:15:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-22 11:15:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5837837837837838) internal successors, (293), 185 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2022-07-22 11:15:51,463 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 63 [2022-07-22 11:15:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:51,463 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2022-07-22 11:15:51,463 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:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2022-07-22 11:15:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 11:15:51,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:51,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:51,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:15:51,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:51,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:51,469 INFO L85 PathProgramCache]: Analyzing trace with hash -848424362, now seen corresponding path program 1 times [2022-07-22 11:15:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:51,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231623742] [2022-07-22 11:15:51,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:51,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231623742] [2022-07-22 11:15:51,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231623742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:51,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:51,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403612395] [2022-07-22 11:15:51,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:51,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:51,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:51,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:51,546 INFO L87 Difference]: Start difference. First operand 186 states and 293 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:53,551 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:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:53,714 INFO L93 Difference]: Finished difference Result 364 states and 576 transitions. [2022-07-22 11:15:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:53,715 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:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:53,715 INFO L225 Difference]: With dead ends: 364 [2022-07-22 11:15:53,715 INFO L226 Difference]: Without dead ends: 199 [2022-07-22 11:15:53,716 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:53,716 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 20 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 449 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:53,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 449 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:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-22 11:15:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-22 11:15:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5783783783783785) internal successors, (292), 185 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:15:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 292 transitions. [2022-07-22 11:15:53,719 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 292 transitions. Word has length 64 [2022-07-22 11:15:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:53,719 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 292 transitions. [2022-07-22 11:15:53,720 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:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 292 transitions. [2022-07-22 11:15:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 11:15:53,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:53,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:15:53,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:15:53,720 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2026506290, now seen corresponding path program 1 times [2022-07-22 11:15:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:53,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433767098] [2022-07-22 11:15:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:53,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:53,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433767098] [2022-07-22 11:15:53,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433767098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:53,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:53,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430081256] [2022-07-22 11:15:53,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:53,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:53,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:53,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:53,799 INFO L87 Difference]: Start difference. First operand 186 states and 292 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:55,808 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:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:55,988 INFO L93 Difference]: Finished difference Result 354 states and 562 transitions. [2022-07-22 11:15:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:55,988 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:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:55,989 INFO L225 Difference]: With dead ends: 354 [2022-07-22 11:15:55,989 INFO L226 Difference]: Without dead ends: 189 [2022-07-22 11:15:55,989 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:55,990 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 463 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:55,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 463 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:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-22 11:15:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2022-07-22 11:15:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.572972972972973) internal successors, (291), 185 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2022-07-22 11:15:55,995 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 65 [2022-07-22 11:15:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:55,995 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2022-07-22 11:15:55,996 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:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2022-07-22 11:15:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 11:15:55,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:55,996 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:55,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:15:55,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1546297802, now seen corresponding path program 1 times [2022-07-22 11:15:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:55,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458839901] [2022-07-22 11:15:55,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:55,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:56,085 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:56,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:56,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458839901] [2022-07-22 11:15:56,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458839901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:56,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:56,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055723698] [2022-07-22 11:15:56,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:56,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:56,089 INFO L87 Difference]: Start difference. First operand 186 states and 291 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:58,095 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:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:58,392 INFO L93 Difference]: Finished difference Result 464 states and 731 transitions. [2022-07-22 11:15:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:58,392 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:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:58,394 INFO L225 Difference]: With dead ends: 464 [2022-07-22 11:15:58,395 INFO L226 Difference]: Without dead ends: 297 [2022-07-22 11:15:58,395 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:58,395 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:58,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 312 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:15:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-22 11:15:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 228. [2022-07-22 11:15:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6255506607929515) internal successors, (369), 227 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 369 transitions. [2022-07-22 11:15:58,401 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 369 transitions. Word has length 65 [2022-07-22 11:15:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:58,401 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 369 transitions. [2022-07-22 11:15:58,401 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:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 369 transitions. [2022-07-22 11:15:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 11:15:58,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:58,402 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] [2022-07-22 11:15:58,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:15:58,403 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2039258828, now seen corresponding path program 1 times [2022-07-22 11:15:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:58,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743331938] [2022-07-22 11:15:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:58,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:58,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743331938] [2022-07-22 11:15:58,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743331938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:58,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:58,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:58,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530005293] [2022-07-22 11:15:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:58,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:58,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:58,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:58,516 INFO L87 Difference]: Start difference. First operand 228 states and 369 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:00,521 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:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:00,851 INFO L93 Difference]: Finished difference Result 543 states and 879 transitions. [2022-07-22 11:16:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:00,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-22 11:16:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:00,853 INFO L225 Difference]: With dead ends: 543 [2022-07-22 11:16:00,853 INFO L226 Difference]: Without dead ends: 336 [2022-07-22 11:16:00,854 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:16:00,854 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 117 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:00,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:16:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-22 11:16:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 260. [2022-07-22 11:16:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.6447876447876448) internal successors, (426), 259 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 426 transitions. [2022-07-22 11:16:00,859 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 426 transitions. Word has length 93 [2022-07-22 11:16:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:00,859 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 426 transitions. [2022-07-22 11:16:00,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 426 transitions. [2022-07-22 11:16:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-22 11:16:00,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:00,860 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, 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] [2022-07-22 11:16:00,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:16:00,860 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -709781834, now seen corresponding path program 1 times [2022-07-22 11:16:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:00,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833716192] [2022-07-22 11:16:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:16:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:00,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833716192] [2022-07-22 11:16:00,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833716192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:00,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:00,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665668195] [2022-07-22 11:16:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:00,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:00,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:00,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:00,953 INFO L87 Difference]: Start difference. First operand 260 states and 426 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:03,021 INFO L93 Difference]: Finished difference Result 612 states and 998 transitions. [2022-07-22 11:16:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:03,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-22 11:16:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:03,023 INFO L225 Difference]: With dead ends: 612 [2022-07-22 11:16:03,023 INFO L226 Difference]: Without dead ends: 373 [2022-07-22 11:16:03,023 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:16:03,023 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 109 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:03,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 318 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 11:16:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-07-22 11:16:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 303. [2022-07-22 11:16:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.6622516556291391) internal successors, (502), 302 states have internal predecessors, (502), 0 states have call successors, (0), 0 states 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:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 502 transitions. [2022-07-22 11:16:03,028 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 502 transitions. Word has length 105 [2022-07-22 11:16:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:03,028 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 502 transitions. [2022-07-22 11:16:03,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 502 transitions. [2022-07-22 11:16:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:16:03,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:03,029 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:03,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:16:03,029 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:03,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:03,030 INFO L85 PathProgramCache]: Analyzing trace with hash 122955886, now seen corresponding path program 1 times [2022-07-22 11:16:03,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:03,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68858658] [2022-07-22 11:16:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:03,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 11:16:03,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:03,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68858658] [2022-07-22 11:16:03,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68858658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:03,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:03,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007938323] [2022-07-22 11:16:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:03,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:03,106 INFO L87 Difference]: Start difference. First operand 303 states and 502 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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,119 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:16:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:05,388 INFO L93 Difference]: Finished difference Result 696 states and 1147 transitions. [2022-07-22 11:16:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-22 11:16:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:05,390 INFO L225 Difference]: With dead ends: 696 [2022-07-22 11:16:05,390 INFO L226 Difference]: Without dead ends: 414 [2022-07-22 11:16:05,390 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:16:05,391 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 134 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:05,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 302 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 260 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:16:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-22 11:16:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 319. [2022-07-22 11:16:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.650943396226415) internal successors, (525), 318 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 525 transitions. [2022-07-22 11:16:05,397 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 525 transitions. Word has length 106 [2022-07-22 11:16:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:05,397 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 525 transitions. [2022-07-22 11:16:05,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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,398 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 525 transitions. [2022-07-22 11:16:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:16:05,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:05,398 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, 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] [2022-07-22 11:16:05,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:16:05,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 213335615, now seen corresponding path program 1 times [2022-07-22 11:16:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:05,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534635777] [2022-07-22 11:16:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:05,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 11:16:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:05,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534635777] [2022-07-22 11:16:05,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534635777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:05,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:05,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370619512] [2022-07-22 11:16:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:05,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:05,503 INFO L87 Difference]: Start difference. First operand 319 states and 525 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:07,515 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:16:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:07,695 INFO L93 Difference]: Finished difference Result 660 states and 1090 transitions. [2022-07-22 11:16:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:07,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-22 11:16:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:07,697 INFO L225 Difference]: With dead ends: 660 [2022-07-22 11:16:07,697 INFO L226 Difference]: Without dead ends: 362 [2022-07-22 11:16:07,697 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:16:07,698 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 33 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:07,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 461 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:16:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-22 11:16:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-07-22 11:16:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6529411764705881) internal successors, (562), 340 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:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 562 transitions. [2022-07-22 11:16:07,706 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 562 transitions. Word has length 106 [2022-07-22 11:16:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:07,706 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 562 transitions. [2022-07-22 11:16:07,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 562 transitions. [2022-07-22 11:16:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 11:16:07,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:07,707 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 11:16:07,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:16:07,708 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:07,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:07,708 INFO L85 PathProgramCache]: Analyzing trace with hash 427331882, now seen corresponding path program 1 times [2022-07-22 11:16:07,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:07,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906127676] [2022-07-22 11:16:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 11:16:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:07,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906127676] [2022-07-22 11:16:07,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906127676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:07,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:07,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676278017] [2022-07-22 11:16:07,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:07,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:07,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:07,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:07,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:07,787 INFO L87 Difference]: Start difference. First operand 341 states and 562 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:09,796 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:16:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:10,102 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2022-07-22 11:16:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-22 11:16:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:10,103 INFO L225 Difference]: With dead ends: 730 [2022-07-22 11:16:10,103 INFO L226 Difference]: Without dead ends: 410 [2022-07-22 11:16:10,104 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:16:10,104 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 133 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:10,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 316 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:16:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-22 11:16:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-22 11:16:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.638235294117647) internal successors, (557), 340 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 557 transitions. [2022-07-22 11:16:10,110 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 557 transitions. Word has length 107 [2022-07-22 11:16:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:10,110 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 557 transitions. [2022-07-22 11:16:10,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 557 transitions. [2022-07-22 11:16:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-22 11:16:10,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:10,112 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:10,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:16:10,112 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1864076429, now seen corresponding path program 1 times [2022-07-22 11:16:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:10,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713224057] [2022-07-22 11:16:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 11:16:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:10,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713224057] [2022-07-22 11:16:10,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713224057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:10,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:10,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152121037] [2022-07-22 11:16:10,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:10,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:10,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:10,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:10,192 INFO L87 Difference]: Start difference. First operand 341 states and 557 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:12,198 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:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:12,492 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2022-07-22 11:16:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:12,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-22 11:16:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:12,494 INFO L225 Difference]: With dead ends: 729 [2022-07-22 11:16:12,494 INFO L226 Difference]: Without dead ends: 409 [2022-07-22 11:16:12,495 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:16:12,495 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 138 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 318 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:16:12,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:16:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-22 11:16:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 341. [2022-07-22 11:16:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6205882352941177) internal successors, (551), 340 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 551 transitions. [2022-07-22 11:16:12,502 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 551 transitions. Word has length 120 [2022-07-22 11:16:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:12,502 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 551 transitions. [2022-07-22 11:16:12,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 551 transitions. [2022-07-22 11:16:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-22 11:16:12,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:12,504 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:12,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:16:12,504 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash -718677215, now seen corresponding path program 1 times [2022-07-22 11:16:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:12,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572392630] [2022-07-22 11:16:12,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:12,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 11:16:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:12,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572392630] [2022-07-22 11:16:12,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572392630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:12,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:12,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464809604] [2022-07-22 11:16:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:12,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:12,594 INFO L87 Difference]: Start difference. First operand 341 states and 551 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:14,600 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:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:14,875 INFO L93 Difference]: Finished difference Result 729 states and 1168 transitions. [2022-07-22 11:16:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:14,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-22 11:16:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:14,876 INFO L225 Difference]: With dead ends: 729 [2022-07-22 11:16:14,876 INFO L226 Difference]: Without dead ends: 409 [2022-07-22 11:16:14,877 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:16:14,877 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 136 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:14,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 304 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:16:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-22 11:16:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 341. [2022-07-22 11:16:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6029411764705883) internal successors, (545), 340 states have internal predecessors, (545), 0 states have call successors, (0), 0 states 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:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 545 transitions. [2022-07-22 11:16:14,883 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 545 transitions. Word has length 120 [2022-07-22 11:16:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:14,883 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 545 transitions. [2022-07-22 11:16:14,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 545 transitions. [2022-07-22 11:16:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-22 11:16:14,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:14,884 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, 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] [2022-07-22 11:16:14,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:16:14,885 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash 378996041, now seen corresponding path program 1 times [2022-07-22 11:16:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:14,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998542422] [2022-07-22 11:16:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 11:16:14,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:14,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998542422] [2022-07-22 11:16:14,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998542422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:14,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:14,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611375657] [2022-07-22 11:16:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:14,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:14,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:14,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:14,956 INFO L87 Difference]: Start difference. First operand 341 states and 545 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:16,961 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:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:17,169 INFO L93 Difference]: Finished difference Result 678 states and 1088 transitions. [2022-07-22 11:16:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-22 11:16:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:17,170 INFO L225 Difference]: With dead ends: 678 [2022-07-22 11:16:17,170 INFO L226 Difference]: Without dead ends: 358 [2022-07-22 11:16:17,171 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:16:17,171 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 469 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:16:17,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:16:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-22 11:16:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-07-22 11:16:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6) internal successors, (544), 340 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 544 transitions. [2022-07-22 11:16:17,180 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 544 transitions. Word has length 120 [2022-07-22 11:16:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:17,180 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 544 transitions. [2022-07-22 11:16:17,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 544 transitions. [2022-07-22 11:16:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-22 11:16:17,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:17,182 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:17,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:16:17,182 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1084989027, now seen corresponding path program 1 times [2022-07-22 11:16:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:17,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430925960] [2022-07-22 11:16:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 11:16:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:17,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430925960] [2022-07-22 11:16:17,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430925960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:17,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:17,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573293272] [2022-07-22 11:16:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:17,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:17,271 INFO L87 Difference]: Start difference. First operand 341 states and 544 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:16:19,276 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:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:19,465 INFO L93 Difference]: Finished difference Result 678 states and 1086 transitions. [2022-07-22 11:16:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:19,466 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 121 [2022-07-22 11:16:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:19,467 INFO L225 Difference]: With dead ends: 678 [2022-07-22 11:16:19,467 INFO L226 Difference]: Without dead ends: 358 [2022-07-22 11:16:19,468 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:16:19,469 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 37 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 469 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:16:19,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:16:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-22 11:16:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-07-22 11:16:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5970588235294119) internal successors, (543), 340 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 543 transitions. [2022-07-22 11:16:19,482 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 543 transitions. Word has length 121 [2022-07-22 11:16:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:19,482 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 543 transitions. [2022-07-22 11:16:19,482 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:16:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 543 transitions. [2022-07-22 11:16:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:16:19,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:19,484 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:19,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:16:19,484 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash -112241050, now seen corresponding path program 1 times [2022-07-22 11:16:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:19,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146820579] [2022-07-22 11:16:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 11:16:19,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:19,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146820579] [2022-07-22 11:16:19,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146820579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:19,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:19,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210664641] [2022-07-22 11:16:19,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:19,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:19,593 INFO L87 Difference]: Start difference. First operand 341 states and 543 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:16:21,607 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:16:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:21,918 INFO L93 Difference]: Finished difference Result 729 states and 1152 transitions. [2022-07-22 11:16:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:21,919 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 122 [2022-07-22 11:16:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:21,920 INFO L225 Difference]: With dead ends: 729 [2022-07-22 11:16:21,920 INFO L226 Difference]: Without dead ends: 409 [2022-07-22 11:16:21,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:21,921 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 133 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 318 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:16:21,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:16:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-22 11:16:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 341. [2022-07-22 11:16:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5794117647058823) internal successors, (537), 340 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 537 transitions. [2022-07-22 11:16:21,926 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 537 transitions. Word has length 122 [2022-07-22 11:16:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:21,927 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 537 transitions. [2022-07-22 11:16:21,927 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:16:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 537 transitions. [2022-07-22 11:16:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-22 11:16:21,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:21,928 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:16:21,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:16:21,928 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash -578312574, now seen corresponding path program 1 times [2022-07-22 11:16:21,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:21,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531718576] [2022-07-22 11:16:21,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:21,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 11:16:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:22,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531718576] [2022-07-22 11:16:22,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531718576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:22,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:22,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384826855] [2022-07-22 11:16:22,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:22,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:22,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:22,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:22,008 INFO L87 Difference]: Start difference. First operand 341 states and 537 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:24,014 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:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:24,203 INFO L93 Difference]: Finished difference Result 668 states and 1059 transitions. [2022-07-22 11:16:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:24,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-22 11:16:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:24,205 INFO L225 Difference]: With dead ends: 668 [2022-07-22 11:16:24,205 INFO L226 Difference]: Without dead ends: 348 [2022-07-22 11:16:24,205 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:16:24,206 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 26 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 483 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:16:24,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 483 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:16:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-22 11:16:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2022-07-22 11:16:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.576470588235294) internal successors, (536), 340 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 536 transitions. [2022-07-22 11:16:24,211 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 536 transitions. Word has length 123 [2022-07-22 11:16:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:24,211 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 536 transitions. [2022-07-22 11:16:24,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 536 transitions. [2022-07-22 11:16:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:24,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:24,212 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:24,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:16:24,212 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1128276771, now seen corresponding path program 1 times [2022-07-22 11:16:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:24,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334294868] [2022-07-22 11:16:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:24,510 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:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:24,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334294868] [2022-07-22 11:16:24,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334294868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:24,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:24,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:16:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911529917] [2022-07-22 11:16:24,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:24,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:16:24,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:24,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:16:24,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:24,513 INFO L87 Difference]: Start difference. First operand 341 states and 536 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:26,520 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:28,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:28,776 INFO L93 Difference]: Finished difference Result 679 states and 1068 transitions. [2022-07-22 11:16:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:16:28,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:28,778 INFO L225 Difference]: With dead ends: 679 [2022-07-22 11:16:28,778 INFO L226 Difference]: Without dead ends: 341 [2022-07-22 11:16:28,778 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:28,778 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:28,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:16:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-22 11:16:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-22 11:16:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.5735294117647058) internal successors, (535), 340 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 535 transitions. [2022-07-22 11:16:28,783 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 535 transitions. Word has length 127 [2022-07-22 11:16:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:28,783 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 535 transitions. [2022-07-22 11:16:28,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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,784 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 535 transitions. [2022-07-22 11:16:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:28,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:28,785 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:28,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 11:16:28,785 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1834873377, now seen corresponding path program 1 times [2022-07-22 11:16:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:28,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961848723] [2022-07-22 11:16:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:29,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:16:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:29,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:16:29,404 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:16:29,405 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:16:29,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 11:16:29,410 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:29,413 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:16:29,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:16:29 BoogieIcfgContainer [2022-07-22 11:16:29,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:16:29,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:16:29,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:16:29,546 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:16:29,546 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:33" (3/4) ... [2022-07-22 11:16:29,549 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 11:16:29,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:16:29,549 INFO L158 Benchmark]: Toolchain (without parser) took 59792.61ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 56.8MB in the beginning and 96.0MB in the end (delta: -39.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2022-07-22 11:16:29,549 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:16:29,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.08ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 46.8MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 11:16:29,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.89ms. Allocated memory is still 92.3MB. Free memory was 46.8MB in the beginning and 41.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:16:29,550 INFO L158 Benchmark]: Boogie Preprocessor took 108.12ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 41.9MB in the beginning and 81.5MB in the end (delta: -39.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2022-07-22 11:16:29,552 INFO L158 Benchmark]: RCFGBuilder took 2761.19ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 78.0MB in the end (delta: 3.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-07-22 11:16:29,552 INFO L158 Benchmark]: TraceAbstraction took 56358.81ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 78.0MB in the beginning and 97.0MB in the end (delta: -19.0MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. [2022-07-22 11:16:29,552 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 161.5MB. Free memory was 97.0MB in the beginning and 96.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:16:29,559 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 92.3MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.08ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 46.8MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.89ms. Allocated memory is still 92.3MB. Free memory was 46.8MB in the beginning and 41.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.12ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 41.9MB in the beginning and 81.5MB in the end (delta: -39.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2761.19ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 78.0MB in the end (delta: 3.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 56358.81ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 78.0MB in the beginning and 97.0MB in the end (delta: -19.0MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 161.5MB. Free memory was 97.0MB in the beginning and 96.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1733]: 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 1152. 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 ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [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 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->info_callback={0:-12}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967294:0}, s={-4294967294:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-12}, blastFlag=1, got_new_session=0, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=1, got_new_session=1, init=1, ret=1, s={-4294967294:0}, s={-4294967294:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1388] s->init_num = 0 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-12}, blastFlag=2, got_new_session=1, init=1, ret=8, s={-4294967294:0}, s={-4294967294:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND TRUE s->state == 8656 [L1581] EXPR s->session [L1581] EXPR s->s3 [L1581] EXPR (s->s3)->tmp.new_cipher [L1581] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1582] COND FALSE !(! tmp___9) [L1588] ret = __VERIFIER_nondet_int() [L1589] COND TRUE blastFlag == 2 [L1590] blastFlag = 4 VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1605] COND FALSE !(! tmp___10) VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->s3={-4294967290:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=15, s={-4294967294:0}, s={-4294967294:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 4 VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=-14, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1733] reach_error() VAL [={0:-12}, blastFlag=4, got_new_session=1, init=1, ret=-14, s={-4294967294:0}, s={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.2s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 52.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 1476 SdHoareTripleChecker+Valid, 51.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1476 mSDsluCounter, 9447 SdHoareTripleChecker+Invalid, 50.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5867 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4419 IncrementalHoareTripleChecker+Invalid, 5054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 3580 mSDtfsCounter, 4419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=15, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 838 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2158 NumberOfCodeBlocks, 2158 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2008 ConstructedInterpolants, 0 QuantifiedInterpolants, 4903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1128/1128 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:29,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.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 77bf68ba948969a1221675397215385a80fe998a5bd74b2516bc1a677cd2e8b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:16:31,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:16:31,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:16:31,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:16:31,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:16:31,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:16:31,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:16:31,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:16:31,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:16:31,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:16:31,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:16:31,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:16:31,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:16:31,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:16:31,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:16:31,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:16:31,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:16:31,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:16:31,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:16:31,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:16:31,470 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:16:31,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:16:31,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:16:31,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:16:31,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:16:31,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:16:31,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:16:31,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:16:31,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:16:31,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:16:31,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:16:31,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:16:31,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:16:31,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:16:31,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:16:31,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:16:31,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:16:31,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:16:31,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:16:31,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:16:31,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:16:31,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:16:31,496 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:31,521 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:16:31,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:16:31,522 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:16:31,522 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:16:31,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:16:31,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:16:31,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:16:31,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:16:31,524 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:16:31,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:16:31,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:16:31,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:16:31,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:16:31,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:16:31,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:16:31,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:16:31,531 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 11:16:31,531 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 11:16:31,531 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 11:16:31,531 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:16:31,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:16:31,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:16:31,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:16:31,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:16:31,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:16:31,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:16:31,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:16:31,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:16:31,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:16:31,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:16:31,533 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 11:16:31,533 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 11:16:31,533 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:16:31,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:16:31,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:16:31,534 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 11:16:31,534 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 -> 77bf68ba948969a1221675397215385a80fe998a5bd74b2516bc1a677cd2e8b7 [2022-07-22 11:16:31,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:16:31,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:16:31,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:16:31,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:16:31,899 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:16:31,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2022-07-22 11:16:31,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992caebde/7ba43c21c3fb4431ab65242b803ca6c6/FLAG8ff00f694 [2022-07-22 11:16:32,331 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:16:32,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2022-07-22 11:16:32,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992caebde/7ba43c21c3fb4431ab65242b803ca6c6/FLAG8ff00f694 [2022-07-22 11:16:32,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992caebde/7ba43c21c3fb4431ab65242b803ca6c6 [2022-07-22 11:16:32,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:16:32,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:16:32,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:16:32,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:16:32,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:16:32,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:16:32" (1/1) ... [2022-07-22 11:16:32,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5905dca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:32, skipping insertion in model container [2022-07-22 11:16:32,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:16:32" (1/1) ... [2022-07-22 11:16:32,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:16:32,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:16:32,802 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.04.i.cil.c[72500,72513] [2022-07-22 11:16:32,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:32,830 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 11:16:32,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:16:32,928 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.04.i.cil.c[72500,72513] [2022-07-22 11:16:32,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:32,934 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:16:32,984 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.04.i.cil.c[72500,72513] [2022-07-22 11:16:32,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:33,005 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:16:33,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:33 WrapperNode [2022-07-22 11:16:33,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:16:33,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:16:33,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:16:33,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:16:33,010 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:33" (1/1) ... [2022-07-22 11:16:33,039 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:33" (1/1) ... [2022-07-22 11:16:33,087 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 752 [2022-07-22 11:16:33,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:16:33,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:16:33,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:16:33,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:16:33,101 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:33" (1/1) ... [2022-07-22 11:16:33,101 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:33" (1/1) ... [2022-07-22 11:16:33,123 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:33" (1/1) ... [2022-07-22 11:16:33,126 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:33" (1/1) ... [2022-07-22 11:16:33,159 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:33" (1/1) ... [2022-07-22 11:16:33,167 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:33" (1/1) ... [2022-07-22 11:16:33,178 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:33" (1/1) ... [2022-07-22 11:16:33,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:16:33,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:16:33,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:16:33,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:16:33,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:33" (1/1) ... [2022-07-22 11:16:33,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:16:33,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:16:33,237 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:33,297 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:33,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:16:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 11:16:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:16:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 11:16:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:16:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:16:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:16:33,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:16:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 11:16:33,475 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:16:33,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:16:33,493 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:16:40,313 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:16:40,313 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:16:40,314 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:16:40,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:16:40,322 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:16:40,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:16:40 BoogieIcfgContainer [2022-07-22 11:16:40,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:16:40,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:16:40,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:16:40,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:16:40,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:16:32" (1/3) ... [2022-07-22 11:16:40,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d7d837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:16:40, skipping insertion in model container [2022-07-22 11:16:40,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:33" (2/3) ... [2022-07-22 11:16:40,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d7d837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:16:40, skipping insertion in model container [2022-07-22 11:16:40,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:16:40" (3/3) ... [2022-07-22 11:16:40,336 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2022-07-22 11:16:40,346 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:16:40,346 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:16:40,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:16:40,385 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@320182c4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ee9be80 [2022-07-22 11:16:40,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:16:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:16:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 11:16:40,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:40,396 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:40,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1430118927, now seen corresponding path program 1 times [2022-07-22 11:16:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:40,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072680100] [2022-07-22 11:16:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:40,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:40,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:40,413 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:40,414 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:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:40,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:40,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:41,043 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:41,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:41,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:41,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072680100] [2022-07-22 11:16:41,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072680100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:41,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:41,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854537321] [2022-07-22 11:16:41,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:41,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:41,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:41,067 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:41,127 INFO L93 Difference]: Finished difference Result 412 states and 698 transitions. [2022-07-22 11:16:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:41,129 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:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:41,136 INFO L225 Difference]: With dead ends: 412 [2022-07-22 11:16:41,137 INFO L226 Difference]: Without dead ends: 251 [2022-07-22 11:16:41,139 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:41,152 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 186 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:41,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 456 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:16:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-22 11:16:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-07-22 11:16:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.516) internal successors, (379), 250 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2022-07-22 11:16:41,201 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 47 [2022-07-22 11:16:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:41,201 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2022-07-22 11:16:41,202 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:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2022-07-22 11:16:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 11:16:41,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:41,204 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:41,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 11:16:41,407 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:41,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:41,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:41,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1889550317, now seen corresponding path program 1 times [2022-07-22 11:16:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:41,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239781593] [2022-07-22 11:16:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:41,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:41,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:41,415 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:41,416 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:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:41,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:41,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:41,978 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:41,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:41,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:41,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239781593] [2022-07-22 11:16:41,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239781593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:41,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:41,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075881324] [2022-07-22 11:16:41,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:41,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:41,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:41,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:41,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:41,981 INFO L87 Difference]: Start difference. First operand 251 states and 379 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:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:42,076 INFO L93 Difference]: Finished difference Result 490 states and 746 transitions. [2022-07-22 11:16:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:42,077 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:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:42,078 INFO L225 Difference]: With dead ends: 490 [2022-07-22 11:16:42,079 INFO L226 Difference]: Without dead ends: 368 [2022-07-22 11:16:42,079 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:42,080 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:42,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 557 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:16:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-22 11:16:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-07-22 11:16:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.5122615803814714) internal successors, (555), 367 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2022-07-22 11:16:42,101 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 64 [2022-07-22 11:16:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:42,102 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2022-07-22 11:16:42,102 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:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2022-07-22 11:16:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 11:16:42,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:42,107 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:42,140 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:42,320 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:42,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:42,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1833682444, now seen corresponding path program 1 times [2022-07-22 11:16:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:42,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766052970] [2022-07-22 11:16:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:42,344 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:42,345 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:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:42,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:42,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:42,931 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:42,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:42,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:42,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766052970] [2022-07-22 11:16:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766052970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:42,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:42,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933967438] [2022-07-22 11:16:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:42,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:42,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:42,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:42,933 INFO L87 Difference]: Start difference. First operand 368 states and 555 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:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:43,017 INFO L93 Difference]: Finished difference Result 724 states and 1098 transitions. [2022-07-22 11:16:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:43,018 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:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:43,019 INFO L225 Difference]: With dead ends: 724 [2022-07-22 11:16:43,019 INFO L226 Difference]: Without dead ends: 485 [2022-07-22 11:16:43,020 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:43,021 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 134 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:43,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 561 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:16:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-07-22 11:16:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2022-07-22 11:16:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.512396694214876) internal successors, (732), 484 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:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 732 transitions. [2022-07-22 11:16:43,031 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 732 transitions. Word has length 86 [2022-07-22 11:16:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:43,031 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 732 transitions. [2022-07-22 11:16:43,031 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:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 732 transitions. [2022-07-22 11:16:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:43,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:43,033 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:43,064 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:43,247 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:43,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:43,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1128276771, now seen corresponding path program 1 times [2022-07-22 11:16:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:43,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837350331] [2022-07-22 11:16:43,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:43,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:43,255 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:43,256 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:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:44,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 11:16:44,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:44,212 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:44,221 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:44,720 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-22 11:16:44,720 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:44,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,806 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:44,964 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-22 11:16:44,964 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:44,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:44,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:45,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:45,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:45,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:45,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:45,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:45,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:45,018 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:45,037 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:45,042 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:45,068 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:45,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:45,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837350331] [2022-07-22 11:16:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837350331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:45,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:45,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:16:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367518367] [2022-07-22 11:16:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:45,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:16:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:16:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:45,070 INFO L87 Difference]: Start difference. First operand 485 states and 732 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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,092 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:49,104 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:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:56,751 INFO L93 Difference]: Finished difference Result 967 states and 1460 transitions. [2022-07-22 11:16:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:16:56,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:56,755 INFO L225 Difference]: With dead ends: 967 [2022-07-22 11:16:56,755 INFO L226 Difference]: Without dead ends: 485 [2022-07-22 11:16:56,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 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:56,756 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:56,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2022-07-22 11:16:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-07-22 11:16:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2022-07-22 11:16:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 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:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 731 transitions. [2022-07-22 11:16:56,765 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 731 transitions. Word has length 127 [2022-07-22 11:16:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:56,766 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 731 transitions. [2022-07-22 11:16:56,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 731 transitions. [2022-07-22 11:16:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:56,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:56,770 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:56,792 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:56,971 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:56,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1834873377, now seen corresponding path program 1 times [2022-07-22 11:16:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:56,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050245999] [2022-07-22 11:16:56,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:56,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:56,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:56,974 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:56,974 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:17:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:17:00,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:17:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:17:02,517 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-22 11:17:02,517 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:17:02,518 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:17:02,545 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:17:02,740 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:17:02,742 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-22 11:17:02,746 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:17:02,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:17:02 BoogieIcfgContainer [2022-07-22 11:17:02,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:17:02,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:17:02,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:17:02,955 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:17:02,955 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:40" (3/4) ... [2022-07-22 11:17:02,956 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 11:17:03,046 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:17:03,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:17:03,047 INFO L158 Benchmark]: Toolchain (without parser) took 30690.79ms. Allocated memory was 50.3MB in the beginning and 92.3MB in the end (delta: 41.9MB). Free memory was 25.0MB in the beginning and 34.5MB in the end (delta: -9.5MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-07-22 11:17:03,047 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 50.3MB. Free memory is still 32.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:17:03,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.48ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 24.8MB in the beginning and 27.0MB in the end (delta: -2.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-07-22 11:17:03,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.43ms. Allocated memory is still 62.9MB. Free memory was 26.6MB in the beginning and 41.1MB in the end (delta: -14.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:17:03,048 INFO L158 Benchmark]: Boogie Preprocessor took 92.11ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 33.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 11:17:03,048 INFO L158 Benchmark]: RCFGBuilder took 7136.20ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 33.8MB in the beginning and 26.8MB in the end (delta: 7.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-07-22 11:17:03,049 INFO L158 Benchmark]: TraceAbstraction took 22628.36ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 26.3MB in the beginning and 50.1MB in the end (delta: -23.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-07-22 11:17:03,049 INFO L158 Benchmark]: Witness Printer took 92.45ms. Allocated memory is still 92.3MB. Free memory was 50.1MB in the beginning and 34.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 11:17:03,052 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.47ms. Allocated memory is still 50.3MB. Free memory is still 32.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 648.48ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 24.8MB in the beginning and 27.0MB in the end (delta: -2.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.43ms. Allocated memory is still 62.9MB. Free memory was 26.6MB in the beginning and 41.1MB in the end (delta: -14.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.11ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 33.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7136.20ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 33.8MB in the beginning and 26.8MB in the end (delta: 7.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22628.36ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 26.3MB in the beginning and 50.1MB in the end (delta: -23.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 92.45ms. Allocated memory is still 92.3MB. Free memory was 50.1MB in the beginning and 34.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 1733]: 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 ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [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 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->cert={-2147483636:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={-2147483633:0}, s={-2147483633:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=0, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1388] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0] [L1260] COND TRUE s->state == 8656 [L1581] EXPR s->session [L1581] EXPR s->s3 [L1581] EXPR (s->s3)->tmp.new_cipher [L1581] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1582] COND FALSE !(! tmp___9) [L1588] ret = __VERIFIER_nondet_int() [L1589] COND TRUE blastFlag == 2 [L1590] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___9=2] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___9=2] [L1605] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->s3={-2147483635:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=1073741824, s={-2147483633:0}, s={-2147483633:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=6, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] [L1733] reach_error() VAL [={0:-2147483648}, blastFlag=4, got_new_session=1, init=1, ret=6, s={-2147483633:0}, s={-2147483633:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=5, tmp=5, tmp___1=0, tmp___10=2, tmp___9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 2205 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1033 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 210 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1172 mSDtfsCounter, 210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=3, InterpolantAutomatonStates: 15, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 668 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2830 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 153/153 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:17:03,092 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