./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.03.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.03.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 c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:15:21,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:15:21,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:15:21,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:15:21,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:15:21,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:15:21,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:15:21,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:15:21,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:15:21,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:15:21,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:15:21,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:15:21,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:15:21,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:15:21,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:15:21,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:15:21,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:15:21,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:15:21,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:15:21,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:15:21,196 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:15:21,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:15:21,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:15:21,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:15:21,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:15:21,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:15:21,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:15:21,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:15:21,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:15:21,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:15:21,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:15:21,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:15:21,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:15:21,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:15:21,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:15:21,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:15:21,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:15:21,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:15:21,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:15:21,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:15:21,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:15:21,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:15:21,213 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:21,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:15:21,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:15:21,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:15:21,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:15:21,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:15:21,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:15:21,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:15:21,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:15:21,230 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:15:21,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:15:21,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:15:21,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:15:21,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:15:21,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:15:21,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:15:21,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:15:21,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:15:21,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:15:21,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:15:21,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:15:21,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:15:21,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:15:21,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:15:21,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:15:21,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:15:21,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:15:21,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:15:21,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:15:21,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:15:21,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:15:21,233 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:15:21,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:15:21,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:15:21,233 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 -> c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 [2022-07-22 11:15:21,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:15:21,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:15:21,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:15:21,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:15:21,390 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:15:21,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-22 11:15:21,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c86f8ff/45ab55bc2e62445497b348fed94d9f18/FLAG117c139ed [2022-07-22 11:15:21,878 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:15:21,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-22 11:15:21,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c86f8ff/45ab55bc2e62445497b348fed94d9f18/FLAG117c139ed [2022-07-22 11:15:22,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c86f8ff/45ab55bc2e62445497b348fed94d9f18 [2022-07-22 11:15:22,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:15:22,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:15:22,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:15:22,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:15:22,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:15:22,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:15:22" (1/1) ... [2022-07-22 11:15:22,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e66da1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:22, skipping insertion in model container [2022-07-22 11:15:22,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:15:22" (1/1) ... [2022-07-22 11:15:22,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:15:22,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:15:22,737 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.03.i.cil.c[72493,72506] [2022-07-22 11:15:22,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:15:22,752 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:15:22,817 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.03.i.cil.c[72493,72506] [2022-07-22 11:15:22,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:15:22,830 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:15:22,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:22 WrapperNode [2022-07-22 11:15:22,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:15:22,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:15:22,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:15:22,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:15:22,837 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:22" (1/1) ... [2022-07-22 11:15:22,852 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:22" (1/1) ... [2022-07-22 11:15:22,887 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 782 [2022-07-22 11:15:22,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:15:22,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:15:22,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:15:22,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:15:22,894 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:22" (1/1) ... [2022-07-22 11:15:22,894 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:22" (1/1) ... [2022-07-22 11:15:22,901 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:22" (1/1) ... [2022-07-22 11:15:22,902 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:22" (1/1) ... [2022-07-22 11:15:22,927 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:22" (1/1) ... [2022-07-22 11:15:22,932 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:22" (1/1) ... [2022-07-22 11:15:22,935 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:22" (1/1) ... [2022-07-22 11:15:22,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:15:22,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:15:22,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:15:22,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:15:22,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:22" (1/1) ... [2022-07-22 11:15:22,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:15:22,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:15:22,990 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:23,015 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:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:15:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:15:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:15:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:15:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:15:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:15:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:15:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:15:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:15:23,188 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:15:23,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:15:23,222 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:15:25,908 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:15:25,908 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:15:25,909 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:15:25,913 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:15:25,914 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:15:25,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:15:25 BoogieIcfgContainer [2022-07-22 11:15:25,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:15:25,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:15:25,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:15:25,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:15:25,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:15:22" (1/3) ... [2022-07-22 11:15:25,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d612ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:15:25, skipping insertion in model container [2022-07-22 11:15:25,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:15:22" (2/3) ... [2022-07-22 11:15:25,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d612ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:15:25, skipping insertion in model container [2022-07-22 11:15:25,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:15:25" (3/3) ... [2022-07-22 11:15:25,922 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2022-07-22 11:15:25,931 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:15:25,932 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:15:25,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:15:25,969 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@35a8eee2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23cae5e0 [2022-07-22 11:15:25,969 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:15:25,972 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:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 11:15:25,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:25,979 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:25,980 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1430119920, now seen corresponding path program 1 times [2022-07-22 11:15:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:25,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550944310] [2022-07-22 11:15:25,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:26,372 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:26,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:26,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550944310] [2022-07-22 11:15:26,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550944310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:26,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:26,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:26,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099686184] [2022-07-22 11:15:26,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:26,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:26,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:26,403 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:28,426 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:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:28,874 INFO L93 Difference]: Finished difference Result 406 states and 687 transitions. [2022-07-22 11:15:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:28,877 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:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:28,884 INFO L225 Difference]: With dead ends: 406 [2022-07-22 11:15:28,884 INFO L226 Difference]: Without dead ends: 246 [2022-07-22 11:15:28,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:28,891 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 142 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:28,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 411 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-22 11:15:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-22 11:15:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 175. [2022-07-22 11:15:28,943 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:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2022-07-22 11:15:28,946 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 47 [2022-07-22 11:15:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:28,946 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2022-07-22 11:15:28,947 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:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2022-07-22 11:15:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 11:15:28,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:28,948 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:28,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:15:28,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1376830255, now seen corresponding path program 1 times [2022-07-22 11:15:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:28,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230557042] [2022-07-22 11:15:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:29,052 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:29,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:29,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230557042] [2022-07-22 11:15:29,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230557042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:29,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:29,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:29,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735358505] [2022-07-22 11:15:29,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:29,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:29,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:29,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:29,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:29,055 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:31,063 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:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:31,276 INFO L93 Difference]: Finished difference Result 368 states and 587 transitions. [2022-07-22 11:15:31,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:31,276 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:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:31,278 INFO L225 Difference]: With dead ends: 368 [2022-07-22 11:15:31,278 INFO L226 Difference]: Without dead ends: 203 [2022-07-22 11:15:31,278 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:31,279 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 22 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:31,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 439 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-22 11:15:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-22 11:15:31,286 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:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 299 transitions. [2022-07-22 11:15:31,286 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 299 transitions. Word has length 48 [2022-07-22 11:15:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:31,287 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 299 transitions. [2022-07-22 11:15:31,287 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:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 299 transitions. [2022-07-22 11:15:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 11:15:31,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:31,288 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:31,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:15:31,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2069426656, now seen corresponding path program 1 times [2022-07-22 11:15:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:31,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285074682] [2022-07-22 11:15:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:31,376 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:31,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:31,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285074682] [2022-07-22 11:15:31,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285074682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:31,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:31,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:31,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019317381] [2022-07-22 11:15:31,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:31,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:31,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:31,387 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:33,399 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:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:33,585 INFO L93 Difference]: Finished difference Result 368 states and 586 transitions. [2022-07-22 11:15:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:33,586 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:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:33,587 INFO L225 Difference]: With dead ends: 368 [2022-07-22 11:15:33,587 INFO L226 Difference]: Without dead ends: 203 [2022-07-22 11:15:33,588 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:33,588 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:33,589 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:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-22 11:15:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-07-22 11:15:33,594 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:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2022-07-22 11:15:33,595 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 298 transitions. Word has length 61 [2022-07-22 11:15:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:33,596 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-07-22 11:15:33,596 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:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 298 transitions. [2022-07-22 11:15:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:33,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:33,597 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:33,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:15:33,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2105609775, now seen corresponding path program 1 times [2022-07-22 11:15:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:33,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075606994] [2022-07-22 11:15:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:15:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:33,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075606994] [2022-07-22 11:15:33,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075606994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:33,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:33,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554665182] [2022-07-22 11:15:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:33,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:33,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:33,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:33,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:33,702 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:35,714 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:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:35,895 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-07-22 11:15:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:35,895 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:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:35,896 INFO L225 Difference]: With dead ends: 367 [2022-07-22 11:15:35,896 INFO L226 Difference]: Without dead ends: 202 [2022-07-22 11:15:35,897 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,899 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:35,899 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:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-22 11:15:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-22 11:15:35,907 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:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 297 transitions. [2022-07-22 11:15:35,907 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 297 transitions. Word has length 62 [2022-07-22 11:15:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:35,908 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 297 transitions. [2022-07-22 11:15:35,908 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:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 297 transitions. [2022-07-22 11:15:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:35,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:35,910 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:35,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:15:35,914 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1980827365, now seen corresponding path program 1 times [2022-07-22 11:15:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:35,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813684162] [2022-07-22 11:15:35,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:35,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:36,054 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:36,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:36,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813684162] [2022-07-22 11:15:36,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813684162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:36,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:36,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:36,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714492154] [2022-07-22 11:15:36,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:36,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:36,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:36,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:36,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:36,058 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:38,069 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:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:38,266 INFO L93 Difference]: Finished difference Result 367 states and 583 transitions. [2022-07-22 11:15:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:38,266 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:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:38,267 INFO L225 Difference]: With dead ends: 367 [2022-07-22 11:15:38,267 INFO L226 Difference]: Without dead ends: 202 [2022-07-22 11:15:38,268 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,268 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 26 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 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:38,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 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:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-22 11:15:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2022-07-22 11:15:38,272 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:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 296 transitions. [2022-07-22 11:15:38,273 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 296 transitions. Word has length 62 [2022-07-22 11:15:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:38,273 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 296 transitions. [2022-07-22 11:15:38,273 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:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 296 transitions. [2022-07-22 11:15:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:38,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:38,274 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:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:15:38,274 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:38,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash 159955684, now seen corresponding path program 1 times [2022-07-22 11:15:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:38,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936270317] [2022-07-22 11:15:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:38,350 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:38,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:38,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936270317] [2022-07-22 11:15:38,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936270317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:38,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:38,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853637787] [2022-07-22 11:15:38,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:38,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:38,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:38,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:38,354 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:40,367 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,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:40,544 INFO L93 Difference]: Finished difference Result 366 states and 581 transitions. [2022-07-22 11:15:40,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:40,545 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:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:40,546 INFO L225 Difference]: With dead ends: 366 [2022-07-22 11:15:40,546 INFO L226 Difference]: Without dead ends: 201 [2022-07-22 11:15:40,546 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,547 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:40,547 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:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-22 11:15:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2022-07-22 11:15:40,552 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:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 295 transitions. [2022-07-22 11:15:40,555 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 295 transitions. Word has length 62 [2022-07-22 11:15:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:40,555 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 295 transitions. [2022-07-22 11:15:40,555 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:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 295 transitions. [2022-07-22 11:15:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:15:40,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:40,557 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:40,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:15:40,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:40,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash 794933796, now seen corresponding path program 1 times [2022-07-22 11:15:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:40,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83703566] [2022-07-22 11:15:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:40,689 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:40,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:40,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83703566] [2022-07-22 11:15:40,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83703566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:40,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:40,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:40,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548433352] [2022-07-22 11:15:40,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:40,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:40,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:40,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:40,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:40,691 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:42,703 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,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:42,870 INFO L93 Difference]: Finished difference Result 364 states and 578 transitions. [2022-07-22 11:15:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:42,871 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,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:42,872 INFO L225 Difference]: With dead ends: 364 [2022-07-22 11:15:42,872 INFO L226 Difference]: Without dead ends: 199 [2022-07-22 11:15:42,872 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,872 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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:42,873 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:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-22 11:15:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-22 11:15:42,877 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:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 294 transitions. [2022-07-22 11:15:42,878 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 294 transitions. Word has length 62 [2022-07-22 11:15:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:42,879 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 294 transitions. [2022-07-22 11:15:42,879 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,879 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 294 transitions. [2022-07-22 11:15:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 11:15:42,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:42,880 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:42,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:15:42,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1302432407, now seen corresponding path program 1 times [2022-07-22 11:15:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:42,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006964514] [2022-07-22 11:15:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:42,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:42,966 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:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006964514] [2022-07-22 11:15:42,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006964514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:42,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:42,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278226735] [2022-07-22 11:15:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:42,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:42,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:42,969 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:44,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:45,207 INFO L93 Difference]: Finished difference Result 364 states and 577 transitions. [2022-07-22 11:15:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:45,208 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:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:45,210 INFO L225 Difference]: With dead ends: 364 [2022-07-22 11:15:45,210 INFO L226 Difference]: Without dead ends: 199 [2022-07-22 11:15:45,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:45,211 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:45,211 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:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-22 11:15:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-22 11:15:45,214 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:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2022-07-22 11:15:45,215 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 63 [2022-07-22 11:15:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:45,215 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2022-07-22 11:15:45,215 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:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2022-07-22 11:15:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 11:15:45,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:45,216 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:45,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:15:45,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1198430410, now seen corresponding path program 1 times [2022-07-22 11:15:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:45,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755087574] [2022-07-22 11:15:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:45,279 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:45,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:45,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755087574] [2022-07-22 11:15:45,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755087574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:45,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:45,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275397784] [2022-07-22 11:15:45,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:45,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:45,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:45,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:45,281 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:47,292 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:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:47,460 INFO L93 Difference]: Finished difference Result 364 states and 576 transitions. [2022-07-22 11:15:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:47,460 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:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:47,461 INFO L225 Difference]: With dead ends: 364 [2022-07-22 11:15:47,461 INFO L226 Difference]: Without dead ends: 199 [2022-07-22 11:15:47,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:47,462 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:47,462 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:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-22 11:15:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2022-07-22 11:15:47,465 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:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 292 transitions. [2022-07-22 11:15:47,465 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 292 transitions. Word has length 64 [2022-07-22 11:15:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:47,465 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 292 transitions. [2022-07-22 11:15:47,465 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:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 292 transitions. [2022-07-22 11:15:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 11:15:47,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:47,466 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:47,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:15:47,466 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1676500242, now seen corresponding path program 1 times [2022-07-22 11:15:47,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:47,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210847122] [2022-07-22 11:15:47,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:47,571 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:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:47,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210847122] [2022-07-22 11:15:47,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210847122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:47,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:47,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:47,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640572929] [2022-07-22 11:15:47,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:47,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:47,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:47,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:47,573 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:49,587 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,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:49,748 INFO L93 Difference]: Finished difference Result 354 states and 562 transitions. [2022-07-22 11:15:49,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:49,748 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:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:49,749 INFO L225 Difference]: With dead ends: 354 [2022-07-22 11:15:49,749 INFO L226 Difference]: Without dead ends: 189 [2022-07-22 11:15:49,749 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,750 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:49,750 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:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-22 11:15:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2022-07-22 11:15:49,753 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:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2022-07-22 11:15:49,753 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 65 [2022-07-22 11:15:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:49,754 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2022-07-22 11:15:49,754 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:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2022-07-22 11:15:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 11:15:49,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:49,754 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:49,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:15:49,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:49,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:49,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1196291754, now seen corresponding path program 1 times [2022-07-22 11:15:49,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:49,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498047344] [2022-07-22 11:15:49,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:49,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:49,854 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:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498047344] [2022-07-22 11:15:49,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498047344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:49,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:49,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158642988] [2022-07-22 11:15:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:49,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:49,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:49,858 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:51,873 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:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:52,182 INFO L93 Difference]: Finished difference Result 465 states and 733 transitions. [2022-07-22 11:15:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:52,182 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:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:52,183 INFO L225 Difference]: With dead ends: 465 [2022-07-22 11:15:52,183 INFO L226 Difference]: Without dead ends: 298 [2022-07-22 11:15:52,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:15:52,184 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 111 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 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:52,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 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:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-22 11:15:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 228. [2022-07-22 11:15:52,188 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:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 369 transitions. [2022-07-22 11:15:52,188 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 369 transitions. Word has length 65 [2022-07-22 11:15:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:52,188 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 369 transitions. [2022-07-22 11:15:52,189 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:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 369 transitions. [2022-07-22 11:15:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 11:15:52,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:52,189 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:52,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:15:52,189 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:52,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash -103652171, now seen corresponding path program 1 times [2022-07-22 11:15:52,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:52,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920095399] [2022-07-22 11:15:52,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:52,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:52,260 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:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920095399] [2022-07-22 11:15:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920095399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:52,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:52,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122074860] [2022-07-22 11:15:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:52,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:52,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:52,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:52,262 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:15:54,268 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:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:54,580 INFO L93 Difference]: Finished difference Result 544 states and 881 transitions. [2022-07-22 11:15:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:54,580 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:15:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:54,582 INFO L225 Difference]: With dead ends: 544 [2022-07-22 11:15:54,582 INFO L226 Difference]: Without dead ends: 337 [2022-07-22 11:15:54,582 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:54,582 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 119 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 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:15:54,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 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:15:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-22 11:15:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 260. [2022-07-22 11:15:54,586 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:15:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 426 transitions. [2022-07-22 11:15:54,587 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 426 transitions. Word has length 93 [2022-07-22 11:15:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:54,587 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 426 transitions. [2022-07-22 11:15:54,588 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:15:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 426 transitions. [2022-07-22 11:15:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-22 11:15:54,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:54,589 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:15:54,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:15:54,589 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -430845807, now seen corresponding path program 1 times [2022-07-22 11:15:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963228326] [2022-07-22 11:15:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:54,706 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:15:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963228326] [2022-07-22 11:15:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963228326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:54,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:54,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716671512] [2022-07-22 11:15:54,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:54,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:54,707 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:15:56,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:15:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:56,969 INFO L93 Difference]: Finished difference Result 613 states and 1000 transitions. [2022-07-22 11:15:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:56,970 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:15:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:56,971 INFO L225 Difference]: With dead ends: 613 [2022-07-22 11:15:56,971 INFO L226 Difference]: Without dead ends: 374 [2022-07-22 11:15:56,972 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:56,972 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 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.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:15:56,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 318 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:15:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-22 11:15:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 303. [2022-07-22 11:15:56,978 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:15:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 502 transitions. [2022-07-22 11:15:56,995 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 502 transitions. Word has length 105 [2022-07-22 11:15:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:56,995 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 502 transitions. [2022-07-22 11:15:56,995 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:15:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 502 transitions. [2022-07-22 11:15:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:15:56,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:56,996 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:15:56,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:15:56,997 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 827966928, now seen corresponding path program 1 times [2022-07-22 11:15:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763819088] [2022-07-22 11:15:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:57,085 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:15:57,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763819088] [2022-07-22 11:15:57,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763819088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:57,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:57,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687768959] [2022-07-22 11:15:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:57,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:57,088 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:15:59,099 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:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:15:59,411 INFO L93 Difference]: Finished difference Result 697 states and 1149 transitions. [2022-07-22 11:15:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:15:59,411 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:15:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:15:59,413 INFO L225 Difference]: With dead ends: 697 [2022-07-22 11:15:59,413 INFO L226 Difference]: Without dead ends: 415 [2022-07-22 11:15:59,413 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:59,413 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 136 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 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:15:59,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 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:15:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-22 11:15:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 319. [2022-07-22 11:15:59,418 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:15:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 525 transitions. [2022-07-22 11:15:59,421 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 525 transitions. Word has length 106 [2022-07-22 11:15:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:15:59,422 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 525 transitions. [2022-07-22 11:15:59,422 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:15:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 525 transitions. [2022-07-22 11:15:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:15:59,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:15:59,423 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:15:59,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:15:59,424 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:15:59,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:15:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash -421532676, now seen corresponding path program 1 times [2022-07-22 11:15:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:15:59,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990268599] [2022-07-22 11:15:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:15:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:15:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:15:59,523 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:15:59,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:15:59,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990268599] [2022-07-22 11:15:59,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990268599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:15:59,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:15:59,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:15:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147425778] [2022-07-22 11:15:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:15:59,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:15:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:15:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:15:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:15:59,525 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:01,531 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:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:01,733 INFO L93 Difference]: Finished difference Result 660 states and 1090 transitions. [2022-07-22 11:16:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:01,734 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:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:01,735 INFO L225 Difference]: With dead ends: 660 [2022-07-22 11:16:01,735 INFO L226 Difference]: Without dead ends: 362 [2022-07-22 11:16:01,735 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:01,736 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:01,736 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:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-22 11:16:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-07-22 11:16:01,740 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:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 562 transitions. [2022-07-22 11:16:01,741 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 562 transitions. Word has length 106 [2022-07-22 11:16:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:01,741 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 562 transitions. [2022-07-22 11:16:01,741 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:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 562 transitions. [2022-07-22 11:16:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 11:16:01,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:01,742 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:01,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:16:01,742 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:01,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1425787158, now seen corresponding path program 1 times [2022-07-22 11:16:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:01,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396835602] [2022-07-22 11:16:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:01,830 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:01,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:01,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396835602] [2022-07-22 11:16:01,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396835602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:01,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:01,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722796759] [2022-07-22 11:16:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:01,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:01,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:01,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:01,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:01,834 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:03,839 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:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:04,121 INFO L93 Difference]: Finished difference Result 731 states and 1193 transitions. [2022-07-22 11:16:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:04,122 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:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:04,123 INFO L225 Difference]: With dead ends: 731 [2022-07-22 11:16:04,123 INFO L226 Difference]: Without dead ends: 411 [2022-07-22 11:16:04,123 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:04,124 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 135 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 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:04,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 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:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-07-22 11:16:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 341. [2022-07-22 11:16:04,128 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:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 557 transitions. [2022-07-22 11:16:04,129 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 557 transitions. Word has length 107 [2022-07-22 11:16:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:04,129 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 557 transitions. [2022-07-22 11:16:04,129 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:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 557 transitions. [2022-07-22 11:16:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-22 11:16:04,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:04,130 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:04,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:16:04,130 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash -778017264, now seen corresponding path program 1 times [2022-07-22 11:16:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:04,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071549725] [2022-07-22 11:16:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:04,217 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:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:04,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071549725] [2022-07-22 11:16:04,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071549725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:04,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:04,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684387207] [2022-07-22 11:16:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:04,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:04,220 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:05,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:06,034 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2022-07-22 11:16:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:06,035 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:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:06,036 INFO L225 Difference]: With dead ends: 730 [2022-07-22 11:16:06,036 INFO L226 Difference]: Without dead ends: 410 [2022-07-22 11:16:06,036 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:06,037 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 140 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:06,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-22 11:16:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-22 11:16:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-22 11:16:06,041 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:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 551 transitions. [2022-07-22 11:16:06,042 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 551 transitions. Word has length 120 [2022-07-22 11:16:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:06,042 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 551 transitions. [2022-07-22 11:16:06,042 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:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 551 transitions. [2022-07-22 11:16:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-22 11:16:06,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:06,043 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:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:16:06,043 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash 934196388, now seen corresponding path program 1 times [2022-07-22 11:16:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032266967] [2022-07-22 11:16:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:06,152 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:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:06,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032266967] [2022-07-22 11:16:06,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032266967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:06,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:06,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686696407] [2022-07-22 11:16:06,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:06,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:06,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:06,154 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:08,167 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:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:08,438 INFO L93 Difference]: Finished difference Result 730 states and 1170 transitions. [2022-07-22 11:16:08,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:08,439 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:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:08,440 INFO L225 Difference]: With dead ends: 730 [2022-07-22 11:16:08,440 INFO L226 Difference]: Without dead ends: 410 [2022-07-22 11:16:08,441 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:08,441 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 138 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 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:08,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 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:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-22 11:16:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-22 11:16:08,446 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:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 545 transitions. [2022-07-22 11:16:08,446 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 545 transitions. Word has length 120 [2022-07-22 11:16:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:08,447 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 545 transitions. [2022-07-22 11:16:08,447 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:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 545 transitions. [2022-07-22 11:16:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-22 11:16:08,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:08,448 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:08,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:16:08,448 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash 691990311, now seen corresponding path program 1 times [2022-07-22 11:16:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:08,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700612601] [2022-07-22 11:16:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:08,536 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:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:08,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700612601] [2022-07-22 11:16:08,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700612601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:08,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:08,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:08,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457224272] [2022-07-22 11:16:08,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:08,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:08,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:08,539 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:09,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:10,117 INFO L93 Difference]: Finished difference Result 678 states and 1088 transitions. [2022-07-22 11:16:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:10,118 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:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:10,124 INFO L225 Difference]: With dead ends: 678 [2022-07-22 11:16:10,124 INFO L226 Difference]: Without dead ends: 358 [2022-07-22 11:16:10,125 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,125 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:10,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 469 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-22 11:16:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-22 11:16:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-07-22 11:16:10,130 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:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 544 transitions. [2022-07-22 11:16:10,130 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 544 transitions. Word has length 120 [2022-07-22 11:16:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:10,131 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 544 transitions. [2022-07-22 11:16:10,131 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:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 544 transitions. [2022-07-22 11:16:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-22 11:16:10,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:10,132 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:10,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:16:10,132 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1061009666, now seen corresponding path program 1 times [2022-07-22 11:16:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:10,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175220494] [2022-07-22 11:16:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:10,217 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:10,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:10,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175220494] [2022-07-22 11:16:10,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175220494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:10,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:10,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796984594] [2022-07-22 11:16:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:10,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:10,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:10,219 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:12,228 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:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:12,421 INFO L93 Difference]: Finished difference Result 678 states and 1086 transitions. [2022-07-22 11:16:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:12,421 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:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:12,423 INFO L225 Difference]: With dead ends: 678 [2022-07-22 11:16:12,423 INFO L226 Difference]: Without dead ends: 358 [2022-07-22 11:16:12,424 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,424 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:12,425 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:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-22 11:16:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2022-07-22 11:16:12,434 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:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 543 transitions. [2022-07-22 11:16:12,435 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 543 transitions. Word has length 121 [2022-07-22 11:16:12,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:12,435 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 543 transitions. [2022-07-22 11:16:12,435 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:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 543 transitions. [2022-07-22 11:16:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:16:12,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:12,436 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:12,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:16:12,437 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:12,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash 955624361, now seen corresponding path program 1 times [2022-07-22 11:16:12,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:12,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420634490] [2022-07-22 11:16:12,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:12,544 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:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:12,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420634490] [2022-07-22 11:16:12,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420634490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:12,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:12,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:12,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281323845] [2022-07-22 11:16:12,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:12,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:12,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:12,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:12,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:12,546 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:13,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:13,896 INFO L93 Difference]: Finished difference Result 730 states and 1154 transitions. [2022-07-22 11:16:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:13,896 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:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:13,898 INFO L225 Difference]: With dead ends: 730 [2022-07-22 11:16:13,898 INFO L226 Difference]: Without dead ends: 410 [2022-07-22 11:16:13,899 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:13,899 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 135 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:13,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 318 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-22 11:16:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-22 11:16:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2022-07-22 11:16:13,906 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:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 537 transitions. [2022-07-22 11:16:13,907 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 537 transitions. Word has length 122 [2022-07-22 11:16:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:13,907 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 537 transitions. [2022-07-22 11:16:13,907 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:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 537 transitions. [2022-07-22 11:16:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-22 11:16:13,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:13,908 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:13,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:16:13,909 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:13,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1509717981, now seen corresponding path program 1 times [2022-07-22 11:16:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:13,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576761118] [2022-07-22 11:16:13,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:14,013 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:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576761118] [2022-07-22 11:16:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576761118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:14,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:14,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:16:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684118411] [2022-07-22 11:16:14,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:14,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:16:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:14,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:16:14,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:16:14,016 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:16,040 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:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:16,201 INFO L93 Difference]: Finished difference Result 668 states and 1059 transitions. [2022-07-22 11:16:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:16:16,202 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:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:16,204 INFO L225 Difference]: With dead ends: 668 [2022-07-22 11:16:16,204 INFO L226 Difference]: Without dead ends: 348 [2022-07-22 11:16:16,204 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:16,205 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:16,205 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:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-22 11:16:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2022-07-22 11:16:16,209 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:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 536 transitions. [2022-07-22 11:16:16,209 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 536 transitions. Word has length 123 [2022-07-22 11:16:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:16,209 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 536 transitions. [2022-07-22 11:16:16,209 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:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 536 transitions. [2022-07-22 11:16:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:16,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:16,210 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:16,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:16:16,210 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash 42738551, now seen corresponding path program 1 times [2022-07-22 11:16:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:16,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826175075] [2022-07-22 11:16:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:16,567 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:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:16:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826175075] [2022-07-22 11:16:16,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826175075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:16,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:16,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:16:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523822014] [2022-07-22 11:16:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:16,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:16:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:16:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:16:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:16,570 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:18,590 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:20,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:16:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:20,853 INFO L93 Difference]: Finished difference Result 679 states and 1068 transitions. [2022-07-22 11:16:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:16:20,853 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:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:20,854 INFO L225 Difference]: With dead ends: 679 [2022-07-22 11:16:20,854 INFO L226 Difference]: Without dead ends: 341 [2022-07-22 11:16:20,855 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:20,855 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.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:20,855 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.3s Time] [2022-07-22 11:16:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-22 11:16:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-22 11:16:20,859 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:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 535 transitions. [2022-07-22 11:16:20,872 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 535 transitions. Word has length 127 [2022-07-22 11:16:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:20,872 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 535 transitions. [2022-07-22 11:16:20,872 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:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 535 transitions. [2022-07-22 11:16:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:20,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:20,873 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:20,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 11:16:20,874 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash -663858055, now seen corresponding path program 1 times [2022-07-22 11:16:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:16:20,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778315379] [2022-07-22 11:16:20,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:20,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:16:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:21,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:16:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:21,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:16:21,649 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:16:21,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:16:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 11:16:21,654 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:21,656 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:16:21,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:16:21 BoogieIcfgContainer [2022-07-22 11:16:21,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:16:21,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:16:21,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:16:21,768 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:16:21,768 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:25" (3/4) ... [2022-07-22 11:16:21,770 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 11:16:21,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:16:21,771 INFO L158 Benchmark]: Toolchain (without parser) took 59349.76ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 61.3MB in the beginning and 39.9MB in the end (delta: 21.4MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2022-07-22 11:16:21,771 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 69.1MB in the beginning and 69.0MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:16:21,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.06ms. Allocated memory is still 98.6MB. Free memory was 61.0MB in the beginning and 53.5MB in the end (delta: 7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 11:16:21,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.35ms. Allocated memory is still 98.6MB. Free memory was 53.5MB in the beginning and 48.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:16:21,771 INFO L158 Benchmark]: Boogie Preprocessor took 52.08ms. Allocated memory is still 98.6MB. Free memory was 48.4MB in the beginning and 41.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 11:16:21,773 INFO L158 Benchmark]: RCFGBuilder took 2975.58ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 41.3MB in the beginning and 87.5MB in the end (delta: -46.3MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2022-07-22 11:16:21,773 INFO L158 Benchmark]: TraceAbstraction took 55850.44ms. Allocated memory is still 132.1MB. Free memory was 87.5MB in the beginning and 41.0MB in the end (delta: 46.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2022-07-22 11:16:21,773 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 132.1MB. Free memory was 41.0MB in the beginning and 39.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:16:21,780 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.17ms. Allocated memory is still 98.6MB. Free memory was 69.1MB in the beginning and 69.0MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.06ms. Allocated memory is still 98.6MB. Free memory was 61.0MB in the beginning and 53.5MB in the end (delta: 7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.35ms. Allocated memory is still 98.6MB. Free memory was 53.5MB in the beginning and 48.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.08ms. Allocated memory is still 98.6MB. Free memory was 48.4MB in the beginning and 41.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2975.58ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 41.3MB in the beginning and 87.5MB in the end (delta: -46.3MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 55850.44ms. Allocated memory is still 132.1MB. Free memory was 87.5MB in the beginning and 41.0MB in the end (delta: 46.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 132.1MB. Free memory was 41.0MB in the beginning and 39.9MB 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: 1734]: 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] [L1693] EXPR s->s3 [L1693] 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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] 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] [L1693] EXPR s->s3 [L1693] 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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] 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 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 VAL [={0:-12}, blastFlag=3, 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] [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 VAL [={0:-12}, blastFlag=3, 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] [L1606] COND FALSE !(! tmp___10) VAL [={0:-12}, blastFlag=3, 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] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-12}, (s->s3)->tmp.reuse_message=4294967328, blastFlag=3, 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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-12}, blastFlag=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 VAL [={0:-12}, blastFlag=3, 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] [L1734] reach_error() VAL [={0:-12}, blastFlag=3, 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: 55.7s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 51.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1494 mSDsluCounter, 9447 SdHoareTripleChecker+Invalid, 49.7s 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, 847 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.1s 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:21,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.03.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 c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:16:23,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:16:23,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:16:23,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:16:23,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:16:23,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:16:23,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:16:23,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:16:23,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:16:23,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:16:23,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:16:23,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:16:23,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:16:23,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:16:23,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:16:23,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:16:23,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:16:23,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:16:23,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:16:23,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:16:23,512 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:16:23,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:16:23,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:16:23,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:16:23,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:16:23,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:16:23,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:16:23,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:16:23,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:16:23,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:16:23,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:16:23,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:16:23,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:16:23,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:16:23,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:16:23,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:16:23,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:16:23,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:16:23,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:16:23,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:16:23,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:16:23,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:16:23,524 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:23,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:16:23,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:16:23,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:16:23,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:16:23,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:16:23,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:16:23,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:16:23,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:16:23,542 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:16:23,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:16:23,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:16:23,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:16:23,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:16:23,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:16:23,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:16:23,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:16:23,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 11:16:23,544 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 11:16:23,544 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 11:16:23,544 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:16:23,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:16:23,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:16:23,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:16:23,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:16:23,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:16:23,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:16:23,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:16:23,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:16:23,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:16:23,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:16:23,546 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 11:16:23,546 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 11:16:23,546 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:16:23,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:16:23,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:16:23,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 11:16:23,546 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 -> c3fe517c51c5e8fb31577c2325f977891c14909f163a953939dc0a15f16ec6d9 [2022-07-22 11:16:23,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:16:23,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:16:23,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:16:23,830 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:16:23,831 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:16:23,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-22 11:16:23,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dfb7d38/ece139115d7e413f87393d6d4fef5c74/FLAG037d0eccc [2022-07-22 11:16:24,301 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:16:24,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2022-07-22 11:16:24,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dfb7d38/ece139115d7e413f87393d6d4fef5c74/FLAG037d0eccc [2022-07-22 11:16:24,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dfb7d38/ece139115d7e413f87393d6d4fef5c74 [2022-07-22 11:16:24,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:16:24,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:16:24,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:16:24,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:16:24,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:16:24,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:16:24" (1/1) ... [2022-07-22 11:16:24,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313504d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:24, skipping insertion in model container [2022-07-22 11:16:24,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:16:24" (1/1) ... [2022-07-22 11:16:24,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:16:24,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:16:25,038 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.03.i.cil.c[72493,72506] [2022-07-22 11:16:25,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:25,057 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 11:16:25,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:16:25,179 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.03.i.cil.c[72493,72506] [2022-07-22 11:16:25,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:25,195 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:16:25,283 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.03.i.cil.c[72493,72506] [2022-07-22 11:16:25,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:16:25,298 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:16:25,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:25 WrapperNode [2022-07-22 11:16:25,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:16:25,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:16:25,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:16:25,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:16:25,304 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:25" (1/1) ... [2022-07-22 11:16:25,335 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:25" (1/1) ... [2022-07-22 11:16:25,371 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 752 [2022-07-22 11:16:25,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:16:25,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:16:25,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:16:25,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:16:25,384 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:25" (1/1) ... [2022-07-22 11:16:25,384 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:25" (1/1) ... [2022-07-22 11:16:25,397 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:25" (1/1) ... [2022-07-22 11:16:25,397 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:25" (1/1) ... [2022-07-22 11:16:25,443 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:25" (1/1) ... [2022-07-22 11:16:25,448 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:25" (1/1) ... [2022-07-22 11:16:25,454 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:25" (1/1) ... [2022-07-22 11:16:25,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:16:25,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:16:25,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:16:25,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:16:25,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:25" (1/1) ... [2022-07-22 11:16:25,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:16:25,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:16:25,485 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:25,515 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:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:16:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 11:16:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:16:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 11:16:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:16:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:16:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:16:25,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:16:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 11:16:25,677 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:16:25,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:16:25,688 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:16:32,962 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:16:32,962 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:16:32,963 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:16:32,967 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:16:32,968 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:16:32,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:16:32 BoogieIcfgContainer [2022-07-22 11:16:32,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:16:32,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:16:32,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:16:32,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:16:32,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:16:24" (1/3) ... [2022-07-22 11:16:32,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199ba505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:16:32, skipping insertion in model container [2022-07-22 11:16:32,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:16:25" (2/3) ... [2022-07-22 11:16:32,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199ba505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:16:32, skipping insertion in model container [2022-07-22 11:16:32,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:16:32" (3/3) ... [2022-07-22 11:16:32,974 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2022-07-22 11:16:32,983 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:16:32,983 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:16:33,012 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:16:33,021 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@59c1f6ad, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@699fb0ca [2022-07-22 11:16:33,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:16:33,025 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:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 11:16:33,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:33,033 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:33,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1430119920, now seen corresponding path program 1 times [2022-07-22 11:16:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:33,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255056561] [2022-07-22 11:16:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:33,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:33,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:33,050 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:33,051 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:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:33,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:33,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:33,660 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:33,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:33,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:33,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255056561] [2022-07-22 11:16:33,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255056561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:33,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:33,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:33,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324768204] [2022-07-22 11:16:33,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:33,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:33,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:33,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:33,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:33,686 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:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:33,749 INFO L93 Difference]: Finished difference Result 412 states and 698 transitions. [2022-07-22 11:16:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:33,751 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:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:33,758 INFO L225 Difference]: With dead ends: 412 [2022-07-22 11:16:33,758 INFO L226 Difference]: Without dead ends: 251 [2022-07-22 11:16:33,761 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:33,763 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:33,764 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:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-22 11:16:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-07-22 11:16:33,795 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:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2022-07-22 11:16:33,797 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 47 [2022-07-22 11:16:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:33,797 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2022-07-22 11:16:33,798 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:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2022-07-22 11:16:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 11:16:33,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:33,800 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:33,831 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:34,017 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:34,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:34,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1008654101, now seen corresponding path program 1 times [2022-07-22 11:16:34,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:34,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893580334] [2022-07-22 11:16:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:34,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:34,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:34,027 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:34,028 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:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:34,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:34,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:34,616 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:34,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:34,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:34,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893580334] [2022-07-22 11:16:34,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893580334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:34,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:34,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:34,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328105781] [2022-07-22 11:16:34,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:34,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:34,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:34,619 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:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:34,710 INFO L93 Difference]: Finished difference Result 490 states and 746 transitions. [2022-07-22 11:16:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:34,711 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:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:34,713 INFO L225 Difference]: With dead ends: 490 [2022-07-22 11:16:34,713 INFO L226 Difference]: Without dead ends: 368 [2022-07-22 11:16:34,713 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:34,714 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:34,714 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:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-22 11:16:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-07-22 11:16:34,727 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:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2022-07-22 11:16:34,728 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 64 [2022-07-22 11:16:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:34,728 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2022-07-22 11:16:34,728 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:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2022-07-22 11:16:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 11:16:34,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:34,731 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:34,765 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:34,947 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:34,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1548644719, now seen corresponding path program 1 times [2022-07-22 11:16:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:34,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640119796] [2022-07-22 11:16:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:34,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:34,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:34,952 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:34,954 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:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:35,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:16:35,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:35,588 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:35,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:35,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:35,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640119796] [2022-07-22 11:16:35,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640119796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:35,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:35,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:16:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524798613] [2022-07-22 11:16:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:35,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:16:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:35,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:16:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:16:35,590 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:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:35,652 INFO L93 Difference]: Finished difference Result 725 states and 1100 transitions. [2022-07-22 11:16:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:16:35,653 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:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:35,655 INFO L225 Difference]: With dead ends: 725 [2022-07-22 11:16:35,655 INFO L226 Difference]: Without dead ends: 486 [2022-07-22 11:16:35,657 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:35,657 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 135 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 561 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:35,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 561 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:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-22 11:16:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-07-22 11:16:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.511340206185567) internal successors, (733), 485 states have internal predecessors, (733), 0 states have call successors, (0), 0 states 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:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 733 transitions. [2022-07-22 11:16:35,668 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 733 transitions. Word has length 86 [2022-07-22 11:16:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:35,668 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 733 transitions. [2022-07-22 11:16:35,668 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:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 733 transitions. [2022-07-22 11:16:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:35,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:35,672 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:35,690 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:35,882 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:35,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash 42738551, now seen corresponding path program 1 times [2022-07-22 11:16:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:35,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781740819] [2022-07-22 11:16:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:35,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:35,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:35,895 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:35,913 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:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:16:36,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 11:16:36,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:16:36,888 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:36,897 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:37,396 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-22 11:16:37,396 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:37,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,471 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:37,631 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-22 11:16:37,631 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:37,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:16:37,661 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:37,683 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:37,690 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:37,719 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:37,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:16:37,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:16:37,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781740819] [2022-07-22 11:16:37,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781740819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:16:37,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:16:37,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:16:37,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480938574] [2022-07-22 11:16:37,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:16:37,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:16:37,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:16:37,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:16:37,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:16:37,724 INFO L87 Difference]: Start difference. First operand 486 states and 733 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:39,745 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:41,753 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:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:16:48,561 INFO L93 Difference]: Finished difference Result 969 states and 1462 transitions. [2022-07-22 11:16:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:16:48,563 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:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:16:48,565 INFO L225 Difference]: With dead ends: 969 [2022-07-22 11:16:48,565 INFO L226 Difference]: Without dead ends: 486 [2022-07-22 11:16:48,565 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:48,566 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s 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, 10.7s IncrementalHoareTripleChecker+Time [2022-07-22 11:16:48,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 631 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2022-07-22 11:16:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-22 11:16:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-07-22 11:16:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.5092783505154639) internal successors, (732), 485 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:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 732 transitions. [2022-07-22 11:16:48,579 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 732 transitions. Word has length 127 [2022-07-22 11:16:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:16:48,579 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 732 transitions. [2022-07-22 11:16:48,579 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:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 732 transitions. [2022-07-22 11:16:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-22 11:16:48,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:16:48,583 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:48,625 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:48,807 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:48,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:16:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:16:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash -663858055, now seen corresponding path program 1 times [2022-07-22 11:16:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:16:48,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867296952] [2022-07-22 11:16:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:16:48,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:16:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:16:48,810 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:48,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 11:16:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:51,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:16:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:16:54,298 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-22 11:16:54,298 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:16:54,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:16:54,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 11:16:54,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:16:54,503 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-22 11:16:54,505 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:16:54,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:16:54 BoogieIcfgContainer [2022-07-22 11:16:54,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:16:54,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:16:54,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:16:54,647 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:16:54,647 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:32" (3/4) ... [2022-07-22 11:16:54,649 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 11:16:54,761 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:16:54,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:16:54,764 INFO L158 Benchmark]: Toolchain (without parser) took 30122.04ms. Allocated memory was 62.9MB in the beginning and 119.5MB in the end (delta: 56.6MB). Free memory was 42.1MB in the beginning and 34.5MB in the end (delta: 7.6MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,765 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory was 45.8MB in the beginning and 45.8MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:16:54,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 655.12ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 41.9MB in the beginning and 44.2MB in the end (delta: -2.3MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.41ms. Allocated memory is still 77.6MB. Free memory was 44.2MB in the beginning and 39.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,795 INFO L158 Benchmark]: Boogie Preprocessor took 84.73ms. Allocated memory is still 77.6MB. Free memory was 39.3MB in the beginning and 51.5MB in the end (delta: -12.2MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,795 INFO L158 Benchmark]: RCFGBuilder took 7506.05ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 51.1MB in the beginning and 57.4MB in the end (delta: -6.2MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,796 INFO L158 Benchmark]: TraceAbstraction took 21675.30ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 57.4MB in the beginning and 49.2MB in the end (delta: 8.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,796 INFO L158 Benchmark]: Witness Printer took 117.04ms. Allocated memory is still 119.5MB. Free memory was 49.2MB in the beginning and 34.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 11:16:54,799 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.23ms. Allocated memory is still 62.9MB. Free memory was 45.8MB in the beginning and 45.8MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 655.12ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 41.9MB in the beginning and 44.2MB in the end (delta: -2.3MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.41ms. Allocated memory is still 77.6MB. Free memory was 44.2MB in the beginning and 39.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.73ms. Allocated memory is still 77.6MB. Free memory was 39.3MB in the beginning and 51.5MB in the end (delta: -12.2MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * RCFGBuilder took 7506.05ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 51.1MB in the beginning and 57.4MB in the end (delta: -6.2MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21675.30ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 57.4MB in the beginning and 49.2MB in the end (delta: 8.2MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Witness Printer took 117.04ms. Allocated memory is still 119.5MB. Free memory was 49.2MB in the beginning and 34.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 1734]: 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] [L1693] EXPR s->s3 [L1693] 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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] 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] [L1693] EXPR s->s3 [L1693] 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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] 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 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, 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] [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, 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] [L1606] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=3, 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] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=3, 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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2147483648}, blastFlag=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 VAL [={0:-2147483648}, blastFlag=3, 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] [L1734] reach_error() VAL [={0:-2147483648}, blastFlag=3, 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: 21.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 2205 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1033 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1172 mSDtfsCounter, 211 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=486occurred 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:16:54,842 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