./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:37:08,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:37:08,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:37:08,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:37:08,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:37:08,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:37:08,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:37:08,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:37:08,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:37:08,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:37:08,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:37:08,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:37:08,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:37:08,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:37:08,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:37:08,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:37:08,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:37:08,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:37:08,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:37:08,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:37:08,118 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:37:08,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:37:08,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:37:08,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:37:08,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:37:08,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:37:08,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:37:08,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:37:08,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:37:08,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:37:08,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:37:08,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:37:08,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:37:08,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:37:08,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:37:08,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:37:08,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:37:08,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:37:08,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:37:08,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:37:08,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:37:08,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:37:08,138 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:37:08,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:37:08,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:37:08,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:37:08,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:37:08,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:37:08,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:37:08,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:37:08,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:37:08,161 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:37:08,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:37:08,162 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:37:08,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:37:08,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:37:08,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:37:08,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:37:08,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:37:08,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:37:08,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:37:08,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:37:08,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:37:08,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:37:08,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:37:08,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:37:08,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:37:08,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:37:08,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:37:08,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:37:08,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:37:08,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:37:08,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:37:08,165 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:37:08,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:37:08,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:37:08,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-07-13 11:37:08,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:37:08,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:37:08,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:37:08,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:37:08,363 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:37:08,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-13 11:37:08,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e9ec0d0/810240a8f2d44778af6671418e50b77d/FLAG581a3460d [2022-07-13 11:37:08,820 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:37:08,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-13 11:37:08,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e9ec0d0/810240a8f2d44778af6671418e50b77d/FLAG581a3460d [2022-07-13 11:37:08,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e9ec0d0/810240a8f2d44778af6671418e50b77d [2022-07-13 11:37:08,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:37:08,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:37:08,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:37:08,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:37:08,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:37:08,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:37:08" (1/1) ... [2022-07-13 11:37:08,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649b44fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:08, skipping insertion in model container [2022-07-13 11:37:08,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:37:08" (1/1) ... [2022-07-13 11:37:08,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:37:08,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:37:09,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.01.i.cil-2.c[72913,72926] [2022-07-13 11:37:09,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:37:09,192 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:37:09,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-13 11:37:09,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:37:09,304 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:37:09,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09 WrapperNode [2022-07-13 11:37:09,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:37:09,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:37:09,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:37:09,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:37:09,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,370 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 788 [2022-07-13 11:37:09,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:37:09,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:37:09,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:37:09,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:37:09,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:37:09,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:37:09,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:37:09,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:37:09,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (1/1) ... [2022-07-13 11:37:09,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:37:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:37:09,472 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-13 11:37:09,474 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-13 11:37:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:37:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:37:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:37:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:37:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:37:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:37:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:37:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:37:09,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:37:09,646 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:37:09,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:37:09,656 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:37:12,244 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:37:12,244 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:37:12,244 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:37:12,249 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:37:12,249 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:37:12,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:37:12 BoogieIcfgContainer [2022-07-13 11:37:12,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:37:12,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:37:12,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:37:12,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:37:12,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:37:08" (1/3) ... [2022-07-13 11:37:12,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50073b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:37:12, skipping insertion in model container [2022-07-13 11:37:12,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:37:09" (2/3) ... [2022-07-13 11:37:12,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50073b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:37:12, skipping insertion in model container [2022-07-13 11:37:12,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:37:12" (3/3) ... [2022-07-13 11:37:12,256 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-07-13 11:37:12,264 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:37:12,264 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:37:12,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:37:12,300 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@51334e19, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bd59478 [2022-07-13 11:37:12,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:37:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:37:12,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:12,312 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-13 11:37:12,313 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-07-13 11:37:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:12,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121038328] [2022-07-13 11:37:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:12,693 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-13 11:37:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:12,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121038328] [2022-07-13 11:37:12,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121038328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:12,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:12,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852388278] [2022-07-13 11:37:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:12,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:12,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:12,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:12,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:12,716 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:14,741 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-13 11:37:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:15,208 INFO L93 Difference]: Finished difference Result 412 states and 693 transitions. [2022-07-13 11:37:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:15,210 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-13 11:37:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:15,221 INFO L225 Difference]: With dead ends: 412 [2022-07-13 11:37:15,221 INFO L226 Difference]: Without dead ends: 250 [2022-07-13 11:37:15,223 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-13 11:37:15,227 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 144 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:15,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 417 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 11:37:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-13 11:37:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2022-07-13 11:37:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.6079545454545454) internal successors, (283), 176 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 283 transitions. [2022-07-13 11:37:15,260 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 283 transitions. Word has length 47 [2022-07-13 11:37:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:15,261 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 283 transitions. [2022-07-13 11:37:15,261 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-13 11:37:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 283 transitions. [2022-07-13 11:37:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:37:15,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:15,263 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-13 11:37:15,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:37:15,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:15,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1376827281, now seen corresponding path program 1 times [2022-07-13 11:37:15,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:15,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337950402] [2022-07-13 11:37:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:15,396 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-13 11:37:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:15,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337950402] [2022-07-13 11:37:15,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337950402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:15,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:15,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678416394] [2022-07-13 11:37:15,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:15,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:15,401 INFO L87 Difference]: Start difference. First operand 177 states and 283 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:17,416 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-13 11:37:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:17,635 INFO L93 Difference]: Finished difference Result 372 states and 593 transitions. [2022-07-13 11:37:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:17,636 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-13 11:37:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:17,637 INFO L225 Difference]: With dead ends: 372 [2022-07-13 11:37:17,637 INFO L226 Difference]: Without dead ends: 205 [2022-07-13 11:37:17,638 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-13 11:37:17,639 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 22 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:17,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 448 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-13 11:37:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2022-07-13 11:37:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6149732620320856) internal successors, (302), 187 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 302 transitions. [2022-07-13 11:37:17,647 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 302 transitions. Word has length 48 [2022-07-13 11:37:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:17,647 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 302 transitions. [2022-07-13 11:37:17,647 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-13 11:37:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 302 transitions. [2022-07-13 11:37:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:37:17,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:17,649 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-13 11:37:17,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:37:17,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1326962752, now seen corresponding path program 1 times [2022-07-13 11:37:17,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:17,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699768990] [2022-07-13 11:37:17,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:17,767 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-13 11:37:17,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:17,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699768990] [2022-07-13 11:37:17,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699768990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:17,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:17,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:17,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059947315] [2022-07-13 11:37:17,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:17,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:17,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:17,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:17,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:17,769 INFO L87 Difference]: Start difference. First operand 188 states and 302 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:19,783 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-13 11:37:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:20,079 INFO L93 Difference]: Finished difference Result 514 states and 830 transitions. [2022-07-13 11:37:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:20,080 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-13 11:37:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:20,081 INFO L225 Difference]: With dead ends: 514 [2022-07-13 11:37:20,081 INFO L226 Difference]: Without dead ends: 347 [2022-07-13 11:37:20,082 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-13 11:37:20,083 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:20,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 311 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-13 11:37:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 220. [2022-07-13 11:37:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6118721461187215) internal successors, (353), 219 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 353 transitions. [2022-07-13 11:37:20,092 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 353 transitions. Word has length 61 [2022-07-13 11:37:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:20,092 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 353 transitions. [2022-07-13 11:37:20,092 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-13 11:37:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 353 transitions. [2022-07-13 11:37:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:37:20,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:20,094 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-13 11:37:20,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:37:20,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1254725184, now seen corresponding path program 1 times [2022-07-13 11:37:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:20,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009599152] [2022-07-13 11:37:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:20,198 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-13 11:37:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:20,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009599152] [2022-07-13 11:37:20,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009599152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:20,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:20,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:20,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463163403] [2022-07-13 11:37:20,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:20,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:20,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:20,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:20,201 INFO L87 Difference]: Start difference. First operand 220 states and 353 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:22,209 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-13 11:37:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:22,394 INFO L93 Difference]: Finished difference Result 435 states and 694 transitions. [2022-07-13 11:37:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:22,394 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-13 11:37:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:22,395 INFO L225 Difference]: With dead ends: 435 [2022-07-13 11:37:22,395 INFO L226 Difference]: Without dead ends: 236 [2022-07-13 11:37:22,396 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-13 11:37:22,396 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:22,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 452 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-13 11:37:22,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2022-07-13 11:37:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6073059360730593) internal successors, (352), 219 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2022-07-13 11:37:22,404 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 62 [2022-07-13 11:37:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:22,405 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2022-07-13 11:37:22,405 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-13 11:37:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2022-07-13 11:37:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:37:22,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:22,406 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-13 11:37:22,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:37:22,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:22,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1693511684, now seen corresponding path program 1 times [2022-07-13 11:37:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:22,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961313567] [2022-07-13 11:37:22,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:22,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:22,508 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-13 11:37:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:22,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961313567] [2022-07-13 11:37:22,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961313567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:22,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:22,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:22,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325624251] [2022-07-13 11:37:22,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:22,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:22,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:22,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:22,512 INFO L87 Difference]: Start difference. First operand 220 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:24,517 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-13 11:37:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:24,810 INFO L93 Difference]: Finished difference Result 519 states and 825 transitions. [2022-07-13 11:37:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:24,811 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-13 11:37:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:24,813 INFO L225 Difference]: With dead ends: 519 [2022-07-13 11:37:24,813 INFO L226 Difference]: Without dead ends: 320 [2022-07-13 11:37:24,813 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-13 11:37:24,814 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:24,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 311 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-13 11:37:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 221. [2022-07-13 11:37:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5954545454545455) internal successors, (351), 220 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 351 transitions. [2022-07-13 11:37:24,820 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 351 transitions. Word has length 62 [2022-07-13 11:37:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:24,820 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 351 transitions. [2022-07-13 11:37:24,820 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-13 11:37:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 351 transitions. [2022-07-13 11:37:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 11:37:24,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:24,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:24,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:37:24,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1066809839, now seen corresponding path program 1 times [2022-07-13 11:37:24,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:24,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484090293] [2022-07-13 11:37:24,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:24,926 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-13 11:37:24,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:24,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484090293] [2022-07-13 11:37:24,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484090293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:24,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:24,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:24,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527011712] [2022-07-13 11:37:24,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:24,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:24,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:24,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:24,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:24,929 INFO L87 Difference]: Start difference. First operand 221 states and 351 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:26,935 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-13 11:37:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:27,218 INFO L93 Difference]: Finished difference Result 519 states and 821 transitions. [2022-07-13 11:37:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:27,218 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-13 11:37:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:27,220 INFO L225 Difference]: With dead ends: 519 [2022-07-13 11:37:27,220 INFO L226 Difference]: Without dead ends: 319 [2022-07-13 11:37:27,220 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-13 11:37:27,221 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:27,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-13 11:37:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-07-13 11:37:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 220 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2022-07-13 11:37:27,226 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 63 [2022-07-13 11:37:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:27,226 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2022-07-13 11:37:27,226 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-13 11:37:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2022-07-13 11:37:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 11:37:27,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:27,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:27,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:37:27,230 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1102657701, now seen corresponding path program 1 times [2022-07-13 11:37:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:27,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394942772] [2022-07-13 11:37:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:27,317 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-13 11:37:27,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:27,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394942772] [2022-07-13 11:37:27,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394942772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:27,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:27,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788489139] [2022-07-13 11:37:27,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:27,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:27,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:27,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:27,320 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:29,325 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-13 11:37:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:29,514 INFO L93 Difference]: Finished difference Result 434 states and 682 transitions. [2022-07-13 11:37:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:29,515 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-13 11:37:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:29,516 INFO L225 Difference]: With dead ends: 434 [2022-07-13 11:37:29,516 INFO L226 Difference]: Without dead ends: 234 [2022-07-13 11:37:29,516 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-13 11:37:29,517 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:29,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-13 11:37:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 221. [2022-07-13 11:37:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5727272727272728) internal successors, (346), 220 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2022-07-13 11:37:29,521 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 63 [2022-07-13 11:37:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:29,521 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2022-07-13 11:37:29,522 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-13 11:37:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2022-07-13 11:37:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 11:37:29,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:29,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:29,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:37:29,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:29,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash -195504471, now seen corresponding path program 1 times [2022-07-13 11:37:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:29,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708610498] [2022-07-13 11:37:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:29,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:29,604 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-13 11:37:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:29,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708610498] [2022-07-13 11:37:29,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708610498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:29,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:29,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904441742] [2022-07-13 11:37:29,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:29,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:29,607 INFO L87 Difference]: Start difference. First operand 221 states and 346 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:31,620 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-13 11:37:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:31,957 INFO L93 Difference]: Finished difference Result 519 states and 813 transitions. [2022-07-13 11:37:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:31,958 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-13 11:37:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:31,959 INFO L225 Difference]: With dead ends: 519 [2022-07-13 11:37:31,959 INFO L226 Difference]: Without dead ends: 319 [2022-07-13 11:37:31,959 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-13 11:37:31,960 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:31,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-13 11:37:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-07-13 11:37:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 220 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 342 transitions. [2022-07-13 11:37:31,970 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 342 transitions. Word has length 64 [2022-07-13 11:37:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:31,973 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 342 transitions. [2022-07-13 11:37:31,974 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-13 11:37:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 342 transitions. [2022-07-13 11:37:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:37:31,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:31,976 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-13 11:37:31,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:37:31,977 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:31,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash 307896966, now seen corresponding path program 1 times [2022-07-13 11:37:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:31,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065343934] [2022-07-13 11:37:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:32,086 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-13 11:37:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:32,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065343934] [2022-07-13 11:37:32,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065343934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:32,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:32,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062116676] [2022-07-13 11:37:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:32,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:32,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:32,090 INFO L87 Difference]: Start difference. First operand 221 states and 342 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:34,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:34,380 INFO L93 Difference]: Finished difference Result 519 states and 806 transitions. [2022-07-13 11:37:34,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:34,381 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-13 11:37:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:34,382 INFO L225 Difference]: With dead ends: 519 [2022-07-13 11:37:34,382 INFO L226 Difference]: Without dead ends: 317 [2022-07-13 11:37:34,382 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-13 11:37:34,383 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:34,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-13 11:37:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 246. [2022-07-13 11:37:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5959183673469388) internal successors, (391), 245 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 391 transitions. [2022-07-13 11:37:34,387 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 391 transitions. Word has length 65 [2022-07-13 11:37:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:34,388 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 391 transitions. [2022-07-13 11:37:34,388 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-13 11:37:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 391 transitions. [2022-07-13 11:37:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 11:37:34,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:34,389 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:34,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:37:34,389 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1634406600, now seen corresponding path program 1 times [2022-07-13 11:37:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:34,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187319362] [2022-07-13 11:37:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:37:34,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:34,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187319362] [2022-07-13 11:37:34,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187319362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:34,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:34,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126932413] [2022-07-13 11:37:34,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:34,470 INFO L87 Difference]: Start difference. First operand 246 states and 391 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:36,475 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-13 11:37:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:36,731 INFO L93 Difference]: Finished difference Result 511 states and 814 transitions. [2022-07-13 11:37:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:36,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-13 11:37:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:36,733 INFO L225 Difference]: With dead ends: 511 [2022-07-13 11:37:36,733 INFO L226 Difference]: Without dead ends: 286 [2022-07-13 11:37:36,733 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-13 11:37:36,733 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 30 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:36,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 506 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-13 11:37:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2022-07-13 11:37:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2022-07-13 11:37:36,738 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 94 [2022-07-13 11:37:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:36,738 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2022-07-13 11:37:36,738 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-13 11:37:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2022-07-13 11:37:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 11:37:36,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:36,739 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:36,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:37:36,739 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:36,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash 217673300, now seen corresponding path program 1 times [2022-07-13 11:37:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:36,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704895431] [2022-07-13 11:37:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:36,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 11:37:36,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:36,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704895431] [2022-07-13 11:37:36,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704895431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:36,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:36,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004570816] [2022-07-13 11:37:36,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:36,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:36,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:36,809 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:38,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:38,996 INFO L93 Difference]: Finished difference Result 528 states and 840 transitions. [2022-07-13 11:37:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-13 11:37:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:38,998 INFO L225 Difference]: With dead ends: 528 [2022-07-13 11:37:38,998 INFO L226 Difference]: Without dead ends: 281 [2022-07-13 11:37:38,998 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-13 11:37:38,998 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 20 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:38,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-13 11:37:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2022-07-13 11:37:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5880149812734083) internal successors, (424), 267 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 424 transitions. [2022-07-13 11:37:39,004 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 424 transitions. Word has length 94 [2022-07-13 11:37:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:39,004 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 424 transitions. [2022-07-13 11:37:39,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 424 transitions. [2022-07-13 11:37:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 11:37:39,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:39,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:39,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:37:39,005 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:39,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1724300080, now seen corresponding path program 1 times [2022-07-13 11:37:39,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:39,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667679524] [2022-07-13 11:37:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:39,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 11:37:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:39,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667679524] [2022-07-13 11:37:39,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667679524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:39,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:39,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234450598] [2022-07-13 11:37:39,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:39,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:39,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:39,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:39,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:39,120 INFO L87 Difference]: Start difference. First operand 268 states and 424 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:41,135 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-13 11:37:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:41,324 INFO L93 Difference]: Finished difference Result 518 states and 826 transitions. [2022-07-13 11:37:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:41,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-13 11:37:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:41,326 INFO L225 Difference]: With dead ends: 518 [2022-07-13 11:37:41,326 INFO L226 Difference]: Without dead ends: 271 [2022-07-13 11:37:41,326 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-13 11:37:41,327 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:41,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 472 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-13 11:37:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2022-07-13 11:37:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5842696629213484) internal successors, (423), 267 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 423 transitions. [2022-07-13 11:37:41,331 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 423 transitions. Word has length 95 [2022-07-13 11:37:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:41,332 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 423 transitions. [2022-07-13 11:37:41,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 423 transitions. [2022-07-13 11:37:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 11:37:41,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:41,333 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:41,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:37:41,333 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1693697111, now seen corresponding path program 1 times [2022-07-13 11:37:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:41,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61878754] [2022-07-13 11:37:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 11:37:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:41,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61878754] [2022-07-13 11:37:41,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61878754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:41,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:41,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98212653] [2022-07-13 11:37:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:41,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:41,402 INFO L87 Difference]: Start difference. First operand 268 states and 423 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:43,407 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-13 11:37:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:43,610 INFO L93 Difference]: Finished difference Result 532 states and 844 transitions. [2022-07-13 11:37:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:43,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-13 11:37:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:43,612 INFO L225 Difference]: With dead ends: 532 [2022-07-13 11:37:43,612 INFO L226 Difference]: Without dead ends: 285 [2022-07-13 11:37:43,612 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-13 11:37:43,613 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:43,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-13 11:37:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 268. [2022-07-13 11:37:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5805243445692885) internal successors, (422), 267 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 422 transitions. [2022-07-13 11:37:43,619 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 422 transitions. Word has length 108 [2022-07-13 11:37:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:43,619 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 422 transitions. [2022-07-13 11:37:43,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 422 transitions. [2022-07-13 11:37:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 11:37:43,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:43,620 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:43,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:37:43,621 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash 778760430, now seen corresponding path program 1 times [2022-07-13 11:37:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:43,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168679091] [2022-07-13 11:37:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 11:37:43,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168679091] [2022-07-13 11:37:43,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168679091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:43,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:43,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209623406] [2022-07-13 11:37:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:43,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:43,696 INFO L87 Difference]: Start difference. First operand 268 states and 422 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:45,701 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-13 11:37:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:45,990 INFO L93 Difference]: Finished difference Result 586 states and 915 transitions. [2022-07-13 11:37:45,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:45,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-13 11:37:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:45,991 INFO L225 Difference]: With dead ends: 586 [2022-07-13 11:37:45,991 INFO L226 Difference]: Without dead ends: 339 [2022-07-13 11:37:45,992 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-13 11:37:45,992 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:45,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-13 11:37:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-07-13 11:37:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5655430711610487) internal successors, (418), 267 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 418 transitions. [2022-07-13 11:37:45,997 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 418 transitions. Word has length 109 [2022-07-13 11:37:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:45,997 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 418 transitions. [2022-07-13 11:37:45,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 418 transitions. [2022-07-13 11:37:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 11:37:45,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:45,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:45,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:37:45,998 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1220545399, now seen corresponding path program 1 times [2022-07-13 11:37:45,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:45,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882514907] [2022-07-13 11:37:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:45,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 11:37:46,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:46,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882514907] [2022-07-13 11:37:46,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882514907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:46,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:46,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:46,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440781764] [2022-07-13 11:37:46,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:46,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:46,093 INFO L87 Difference]: Start difference. First operand 268 states and 418 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:48,098 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-13 11:37:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:48,373 INFO L93 Difference]: Finished difference Result 586 states and 907 transitions. [2022-07-13 11:37:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:48,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-07-13 11:37:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:48,375 INFO L225 Difference]: With dead ends: 586 [2022-07-13 11:37:48,375 INFO L226 Difference]: Without dead ends: 339 [2022-07-13 11:37:48,376 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-13 11:37:48,376 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:48,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-13 11:37:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-07-13 11:37:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.550561797752809) internal successors, (414), 267 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 414 transitions. [2022-07-13 11:37:48,381 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 414 transitions. Word has length 111 [2022-07-13 11:37:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:48,381 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 414 transitions. [2022-07-13 11:37:48,381 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-13 11:37:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 414 transitions. [2022-07-13 11:37:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 11:37:48,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:48,382 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:48,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:37:48,382 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash 89193371, now seen corresponding path program 1 times [2022-07-13 11:37:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:48,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693067577] [2022-07-13 11:37:48,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 11:37:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:48,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693067577] [2022-07-13 11:37:48,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693067577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:48,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:48,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768542256] [2022-07-13 11:37:48,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:48,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:48,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:48,471 INFO L87 Difference]: Start difference. First operand 268 states and 414 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:50,477 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-13 11:37:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:50,643 INFO L93 Difference]: Finished difference Result 522 states and 813 transitions. [2022-07-13 11:37:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-07-13 11:37:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:50,645 INFO L225 Difference]: With dead ends: 522 [2022-07-13 11:37:50,645 INFO L226 Difference]: Without dead ends: 275 [2022-07-13 11:37:50,646 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-13 11:37:50,646 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 26 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:50,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 492 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:37:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-13 11:37:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-07-13 11:37:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.546816479400749) internal successors, (413), 267 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 413 transitions. [2022-07-13 11:37:50,651 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 413 transitions. Word has length 112 [2022-07-13 11:37:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:50,651 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 413 transitions. [2022-07-13 11:37:50,651 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-13 11:37:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-07-13 11:37:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 11:37:50,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:50,652 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:50,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:37:50,652 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1884563494, now seen corresponding path program 1 times [2022-07-13 11:37:50,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:50,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943182845] [2022-07-13 11:37:50,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:37:50,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:50,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943182845] [2022-07-13 11:37:50,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943182845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:50,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:50,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862162126] [2022-07-13 11:37:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:50,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:50,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:50,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:50,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:50,747 INFO L87 Difference]: Start difference. First operand 268 states and 413 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:52,752 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-13 11:37:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:53,062 INFO L93 Difference]: Finished difference Result 624 states and 964 transitions. [2022-07-13 11:37:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:53,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-07-13 11:37:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:53,063 INFO L225 Difference]: With dead ends: 624 [2022-07-13 11:37:53,064 INFO L226 Difference]: Without dead ends: 377 [2022-07-13 11:37:53,064 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-13 11:37:53,064 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 116 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:53,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 325 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-13 11:37:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 300. [2022-07-13 11:37:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.5518394648829432) internal successors, (464), 299 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 464 transitions. [2022-07-13 11:37:53,069 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 464 transitions. Word has length 116 [2022-07-13 11:37:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:53,070 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 464 transitions. [2022-07-13 11:37:53,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 464 transitions. [2022-07-13 11:37:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:37:53,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:53,071 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-13 11:37:53,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:37:53,071 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:53,072 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-07-13 11:37:53,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:53,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665465917] [2022-07-13 11:37:53,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:53,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:37:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:53,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665465917] [2022-07-13 11:37:53,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665465917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:53,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:53,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:37:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452132533] [2022-07-13 11:37:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:53,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:37:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:37:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:37:53,170 INFO L87 Difference]: Start difference. First operand 300 states and 464 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,183 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-13 11:37:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:55,455 INFO L93 Difference]: Finished difference Result 694 states and 1072 transitions. [2022-07-13 11:37:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:37:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-13 11:37:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:55,457 INFO L225 Difference]: With dead ends: 694 [2022-07-13 11:37:55,457 INFO L226 Difference]: Without dead ends: 415 [2022-07-13 11:37:55,457 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-13 11:37:55,458 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:55,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 315 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:37:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-13 11:37:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 343. [2022-07-13 11:37:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5614035087719298) internal successors, (534), 342 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 534 transitions. [2022-07-13 11:37:55,463 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 534 transitions. Word has length 127 [2022-07-13 11:37:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:55,463 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 534 transitions. [2022-07-13 11:37:55,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 534 transitions. [2022-07-13 11:37:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:37:55,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:55,465 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-13 11:37:55,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:37:55,465 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:55,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:55,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1658817010, now seen corresponding path program 1 times [2022-07-13 11:37:55,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:55,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174985897] [2022-07-13 11:37:55,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:37:55,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:55,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174985897] [2022-07-13 11:37:55,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174985897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:55,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:55,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:37:55,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070436564] [2022-07-13 11:37:55,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:55,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:37:55,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:55,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:37:55,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:37:55,577 INFO L87 Difference]: Start difference. First operand 343 states and 534 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:55,603 INFO L93 Difference]: Finished difference Result 987 states and 1552 transitions. [2022-07-13 11:37:55,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:37:55,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-13 11:37:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:55,606 INFO L225 Difference]: With dead ends: 987 [2022-07-13 11:37:55,606 INFO L226 Difference]: Without dead ends: 665 [2022-07-13 11:37:55,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:37:55,607 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 143 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:55,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 558 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:37:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-13 11:37:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2022-07-13 11:37:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.566465256797583) internal successors, (1037), 662 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1037 transitions. [2022-07-13 11:37:55,617 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1037 transitions. Word has length 127 [2022-07-13 11:37:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:55,617 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1037 transitions. [2022-07-13 11:37:55,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1037 transitions. [2022-07-13 11:37:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:37:55,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:55,619 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-13 11:37:55,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:37:55,619 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:55,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -390570832, now seen corresponding path program 1 times [2022-07-13 11:37:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:55,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590577126] [2022-07-13 11:37:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:37:55,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:55,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590577126] [2022-07-13 11:37:55,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590577126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:55,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:55,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:37:55,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797115066] [2022-07-13 11:37:55,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:55,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:37:55,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:55,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:37:55,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:37:55,696 INFO L87 Difference]: Start difference. First operand 663 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:55,717 INFO L93 Difference]: Finished difference Result 1580 states and 2483 transitions. [2022-07-13 11:37:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:37:55,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-13 11:37:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:55,720 INFO L225 Difference]: With dead ends: 1580 [2022-07-13 11:37:55,720 INFO L226 Difference]: Without dead ends: 938 [2022-07-13 11:37:55,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:37:55,721 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 138 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:55,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 431 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:37:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-13 11:37:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2022-07-13 11:37:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 1.5635005336179295) internal successors, (1465), 937 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1465 transitions. [2022-07-13 11:37:55,739 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1465 transitions. Word has length 127 [2022-07-13 11:37:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:55,739 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1465 transitions. [2022-07-13 11:37:55,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1465 transitions. [2022-07-13 11:37:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:37:55,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:55,741 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:55,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:37:55,741 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:55,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1945821678, now seen corresponding path program 1 times [2022-07-13 11:37:55,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:55,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666063741] [2022-07-13 11:37:55,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 11:37:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:55,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666063741] [2022-07-13 11:37:55,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666063741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:55,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:55,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:37:55,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051522301] [2022-07-13 11:37:55,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:55,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:37:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:55,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:37:55,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:37:55,809 INFO L87 Difference]: Start difference. First operand 938 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:55,826 INFO L93 Difference]: Finished difference Result 1882 states and 2942 transitions. [2022-07-13 11:37:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:37:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-13 11:37:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:55,829 INFO L225 Difference]: With dead ends: 1882 [2022-07-13 11:37:55,830 INFO L226 Difference]: Without dead ends: 965 [2022-07-13 11:37:55,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:37:55,831 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:55,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 404 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:37:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-07-13 11:37:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2022-07-13 11:37:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.5560165975103735) internal successors, (1500), 964 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1500 transitions. [2022-07-13 11:37:55,845 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1500 transitions. Word has length 127 [2022-07-13 11:37:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:55,846 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1500 transitions. [2022-07-13 11:37:55,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1500 transitions. [2022-07-13 11:37:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:37:55,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:55,847 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-13 11:37:55,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:37:55,848 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:55,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1322540076, now seen corresponding path program 1 times [2022-07-13 11:37:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:55,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588134650] [2022-07-13 11:37:55,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 11:37:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:55,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588134650] [2022-07-13 11:37:55,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588134650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:55,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:55,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:37:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823206687] [2022-07-13 11:37:55,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:55,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:37:55,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:55,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:37:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:37:55,913 INFO L87 Difference]: Start difference. First operand 965 states and 1500 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:55,926 INFO L93 Difference]: Finished difference Result 1591 states and 2470 transitions. [2022-07-13 11:37:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:37:55,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-13 11:37:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:55,928 INFO L225 Difference]: With dead ends: 1591 [2022-07-13 11:37:55,929 INFO L226 Difference]: Without dead ends: 647 [2022-07-13 11:37:55,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:37:55,930 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:55,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:37:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-13 11:37:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-13 11:37:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5386996904024768) internal successors, (994), 646 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 994 transitions. [2022-07-13 11:37:55,943 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 994 transitions. Word has length 127 [2022-07-13 11:37:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:55,944 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 994 transitions. [2022-07-13 11:37:55,944 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-13 11:37:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 994 transitions. [2022-07-13 11:37:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 11:37:55,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:55,946 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:55,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:37:55,946 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash -116280318, now seen corresponding path program 1 times [2022-07-13 11:37:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:55,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432019163] [2022-07-13 11:37:55,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:56,247 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-13 11:37:56,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:56,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432019163] [2022-07-13 11:37:56,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432019163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:56,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:56,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:37:56,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326543798] [2022-07-13 11:37:56,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:56,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:37:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:37:56,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:37:56,249 INFO L87 Difference]: Start difference. First operand 647 states and 994 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:57,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:59,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:59,327 INFO L93 Difference]: Finished difference Result 1291 states and 1984 transitions. [2022-07-13 11:37:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:37:59,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-07-13 11:37:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:59,329 INFO L225 Difference]: With dead ends: 1291 [2022-07-13 11:37:59,329 INFO L226 Difference]: Without dead ends: 647 [2022-07-13 11:37:59,330 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-13 11:37:59,330 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:59,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 11:37:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-13 11:37:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-13 11:37:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5371517027863777) internal successors, (993), 646 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 993 transitions. [2022-07-13 11:37:59,338 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 993 transitions. Word has length 128 [2022-07-13 11:37:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:59,339 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 993 transitions. [2022-07-13 11:37:59,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:37:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 993 transitions. [2022-07-13 11:37:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 11:37:59,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:59,340 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:59,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:37:59,340 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:59,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-07-13 11:37:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:59,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382570281] [2022-07-13 11:37:59,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:59,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:37:59,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:37:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:37:59,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:37:59,866 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:37:59,867 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:37:59,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:37:59,872 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-13 11:37:59,877 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:38:00,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:38:00 BoogieIcfgContainer [2022-07-13 11:38:00,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:38:00,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:38:00,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:38:00,003 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:38:00,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:37:12" (3/4) ... [2022-07-13 11:38:00,006 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:38:00,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:38:00,006 INFO L158 Benchmark]: Toolchain (without parser) took 51152.38ms. Allocated memory was 88.1MB in the beginning and 140.5MB in the end (delta: 52.4MB). Free memory was 50.7MB in the beginning and 86.7MB in the end (delta: -36.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 11:38:00,006 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:38:00,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.84ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 50.5MB in the beginning and 65.5MB in the end (delta: -15.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-13 11:38:00,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.43ms. Allocated memory is still 111.1MB. Free memory was 65.5MB in the beginning and 60.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:38:00,007 INFO L158 Benchmark]: Boogie Preprocessor took 79.33ms. Allocated memory is still 111.1MB. Free memory was 60.8MB in the beginning and 53.5MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:38:00,007 INFO L158 Benchmark]: RCFGBuilder took 2799.35ms. Allocated memory is still 111.1MB. Free memory was 53.5MB in the beginning and 57.6MB in the end (delta: -4.0MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2022-07-13 11:38:00,007 INFO L158 Benchmark]: TraceAbstraction took 47751.07ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 56.9MB in the beginning and 87.8MB in the end (delta: -30.9MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2022-07-13 11:38:00,007 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 140.5MB. Free memory was 87.8MB in the beginning and 86.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:38:00,008 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.15ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.84ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 50.5MB in the beginning and 65.5MB in the end (delta: -15.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.43ms. Allocated memory is still 111.1MB. Free memory was 65.5MB in the beginning and 60.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.33ms. Allocated memory is still 111.1MB. Free memory was 60.8MB in the beginning and 53.5MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2799.35ms. Allocated memory is still 111.1MB. Free memory was 53.5MB in the beginning and 57.6MB in the end (delta: -4.0MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 47751.07ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 56.9MB in the beginning and 87.8MB in the end (delta: -30.9MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 140.5MB. Free memory was 87.8MB in the beginning and 86.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=0, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0, tmp___9=8] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1618] COND TRUE blastFlag == 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1737] reach_error() VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.6s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 1815 SdHoareTripleChecker+Valid, 43.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1815 mSDsluCounter, 9467 SdHoareTripleChecker+Invalid, 42.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5584 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3998 IncrementalHoareTripleChecker+Invalid, 4664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 3883 mSDtfsCounter, 3998 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=21, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 963 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2265 NumberOfCodeBlocks, 2265 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1192/1192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 11:38:00,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:38:01,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:38:01,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:38:01,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:38:01,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:38:01,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:38:01,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:38:01,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:38:01,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:38:01,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:38:01,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:38:01,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:38:01,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:38:01,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:38:01,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:38:01,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:38:01,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:38:01,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:38:01,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:38:01,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:38:01,587 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:38:01,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:38:01,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:38:01,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:38:01,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:38:01,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:38:01,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:38:01,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:38:01,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:38:01,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:38:01,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:38:01,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:38:01,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:38:01,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:38:01,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:38:01,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:38:01,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:38:01,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:38:01,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:38:01,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:38:01,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:38:01,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:38:01,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:38:01,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:38:01,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:38:01,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:38:01,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:38:01,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:38:01,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:38:01,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:38:01,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:38:01,652 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:38:01,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:38:01,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:38:01,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:38:01,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:38:01,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:38:01,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:38:01,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:38:01,653 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:38:01,654 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:38:01,654 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:38:01,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:38:01,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:38:01,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:38:01,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:38:01,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:38:01,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:38:01,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:38:01,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:38:01,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:38:01,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:38:01,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:38:01,657 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:38:01,657 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:38:01,657 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:38:01,657 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:38:01,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:38:01,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:38:01,659 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-07-13 11:38:01,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:38:01,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:38:01,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:38:01,891 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:38:01,892 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:38:01,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-13 11:38:01,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b562ed794/b8d5f4ac8dcc472fb1ac73c110934462/FLAG84e6ac4a6 [2022-07-13 11:38:02,363 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:38:02,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-13 11:38:02,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b562ed794/b8d5f4ac8dcc472fb1ac73c110934462/FLAG84e6ac4a6 [2022-07-13 11:38:02,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b562ed794/b8d5f4ac8dcc472fb1ac73c110934462 [2022-07-13 11:38:02,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:38:02,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:38:02,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:38:02,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:38:02,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:38:02,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:38:02" (1/1) ... [2022-07-13 11:38:02,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5a4b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:02, skipping insertion in model container [2022-07-13 11:38:02,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:38:02" (1/1) ... [2022-07-13 11:38:02,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:38:02,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:38:03,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-13 11:38:03,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:38:03,104 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 11:38:03,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:38:03,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-13 11:38:03,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:38:03,207 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:38:03,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-13 11:38:03,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:38:03,279 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:38:03,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03 WrapperNode [2022-07-13 11:38:03,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:38:03,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:38:03,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:38:03,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:38:03,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,357 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 757 [2022-07-13 11:38:03,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:38:03,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:38:03,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:38:03,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:38:03,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:38:03,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:38:03,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:38:03,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:38:03,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (1/1) ... [2022-07-13 11:38:03,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:38:03,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:38:03,480 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-13 11:38:03,490 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-13 11:38:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:38:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:38:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:38:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 11:38:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:38:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:38:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:38:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:38:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 11:38:03,655 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:38:03,656 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:38:03,668 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:38:10,262 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:38:10,262 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:38:10,263 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:38:10,267 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:38:10,271 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:38:10,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:38:10 BoogieIcfgContainer [2022-07-13 11:38:10,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:38:10,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:38:10,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:38:10,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:38:10,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:38:02" (1/3) ... [2022-07-13 11:38:10,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef359a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:38:10, skipping insertion in model container [2022-07-13 11:38:10,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:03" (2/3) ... [2022-07-13 11:38:10,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef359a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:38:10, skipping insertion in model container [2022-07-13 11:38:10,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:38:10" (3/3) ... [2022-07-13 11:38:10,287 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-07-13 11:38:10,296 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:38:10,297 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:38:10,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:38:10,356 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@24816b39, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74ee6e97 [2022-07-13 11:38:10,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:38:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:38:10,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:10,371 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-13 11:38:10,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-07-13 11:38:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:10,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606619723] [2022-07-13 11:38:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:10,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:10,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:10,388 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-13 11:38:10,426 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-13 11:38:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:10,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:38:10,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:11,023 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-13 11:38:11,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:11,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:11,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606619723] [2022-07-13 11:38:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606619723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:11,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:11,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:38:11,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352814383] [2022-07-13 11:38:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:11,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:38:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:11,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:38:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:11,068 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:11,151 INFO L93 Difference]: Finished difference Result 418 states and 704 transitions. [2022-07-13 11:38:11,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:38:11,154 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-13 11:38:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:11,162 INFO L225 Difference]: With dead ends: 418 [2022-07-13 11:38:11,163 INFO L226 Difference]: Without dead ends: 255 [2022-07-13 11:38:11,166 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-13 11:38:11,168 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 187 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:11,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 457 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:38:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-13 11:38:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-07-13 11:38:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.5118110236220472) internal successors, (384), 254 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 384 transitions. [2022-07-13 11:38:11,225 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 384 transitions. Word has length 47 [2022-07-13 11:38:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:11,226 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 384 transitions. [2022-07-13 11:38:11,226 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-13 11:38:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 384 transitions. [2022-07-13 11:38:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 11:38:11,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:11,229 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-13 11:38:11,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:38:11,430 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-13 11:38:11,431 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:11,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:11,431 INFO L85 PathProgramCache]: Analyzing trace with hash -682574659, now seen corresponding path program 1 times [2022-07-13 11:38:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:11,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705255766] [2022-07-13 11:38:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:11,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:11,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:11,433 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-13 11:38:11,435 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-13 11:38:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:11,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:38:11,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:11,970 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-13 11:38:11,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:11,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705255766] [2022-07-13 11:38:11,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705255766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:11,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:11,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:38:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760098219] [2022-07-13 11:38:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:11,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:38:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:38:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:11,972 INFO L87 Difference]: Start difference. First operand 255 states and 384 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:12,055 INFO L93 Difference]: Finished difference Result 498 states and 757 transitions. [2022-07-13 11:38:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:38:12,056 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-13 11:38:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:12,057 INFO L225 Difference]: With dead ends: 498 [2022-07-13 11:38:12,057 INFO L226 Difference]: Without dead ends: 374 [2022-07-13 11:38:12,058 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-13 11:38:12,059 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:12,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 562 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:38:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-13 11:38:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-07-13 11:38:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.5067024128686326) internal successors, (562), 373 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 562 transitions. [2022-07-13 11:38:12,071 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 562 transitions. Word has length 64 [2022-07-13 11:38:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:12,072 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 562 transitions. [2022-07-13 11:38:12,072 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-13 11:38:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 562 transitions. [2022-07-13 11:38:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 11:38:12,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:12,075 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-13 11:38:12,112 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-13 11:38:12,279 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-13 11:38:12,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash 485035231, now seen corresponding path program 1 times [2022-07-13 11:38:12,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:12,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584268981] [2022-07-13 11:38:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:12,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:12,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:12,282 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-13 11:38:12,283 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-13 11:38:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:12,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:38:12,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:12,823 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-13 11:38:12,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:12,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:12,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584268981] [2022-07-13 11:38:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584268981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:12,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:12,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:38:12,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655770568] [2022-07-13 11:38:12,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:12,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:38:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:38:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:12,826 INFO L87 Difference]: Start difference. First operand 374 states and 562 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:12,919 INFO L93 Difference]: Finished difference Result 737 states and 1115 transitions. [2022-07-13 11:38:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:38:12,920 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-13 11:38:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:12,922 INFO L225 Difference]: With dead ends: 737 [2022-07-13 11:38:12,922 INFO L226 Difference]: Without dead ends: 494 [2022-07-13 11:38:12,923 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-13 11:38:12,924 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:12,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 566 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:38:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-07-13 11:38:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2022-07-13 11:38:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.5050709939148073) internal successors, (742), 493 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 742 transitions. [2022-07-13 11:38:12,934 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 742 transitions. Word has length 86 [2022-07-13 11:38:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:12,935 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 742 transitions. [2022-07-13 11:38:12,935 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-13 11:38:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 742 transitions. [2022-07-13 11:38:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:38:12,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:12,937 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-13 11:38:12,952 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-13 11:38:13,142 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-13 11:38:13,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:13,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-07-13 11:38:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:13,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295752409] [2022-07-13 11:38:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:13,145 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-13 11:38:13,146 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-13 11:38:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:13,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:38:13,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:38:13,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:13,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:13,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295752409] [2022-07-13 11:38:13,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295752409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:13,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:13,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:38:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761037627] [2022-07-13 11:38:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:13,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:38:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:38:13,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:13,785 INFO L87 Difference]: Start difference. First operand 494 states and 742 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:13,907 INFO L93 Difference]: Finished difference Result 854 states and 1285 transitions. [2022-07-13 11:38:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:38:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-13 11:38:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:13,909 INFO L225 Difference]: With dead ends: 854 [2022-07-13 11:38:13,909 INFO L226 Difference]: Without dead ends: 491 [2022-07-13 11:38:13,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:38:13,910 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 138 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:13,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 561 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:38:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-13 11:38:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-13 11:38:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.493877551020408) internal successors, (732), 490 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 732 transitions. [2022-07-13 11:38:13,921 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 732 transitions. Word has length 127 [2022-07-13 11:38:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:13,921 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 732 transitions. [2022-07-13 11:38:13,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 732 transitions. [2022-07-13 11:38:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 11:38:13,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:13,924 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:13,940 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-13 11:38:14,127 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-13 11:38:14,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1760202500, now seen corresponding path program 1 times [2022-07-13 11:38:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:14,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145507581] [2022-07-13 11:38:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:14,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:14,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:14,130 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-13 11:38:14,131 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-13 11:38:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:14,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 11:38:15,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:15,043 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-13 11:38:15,051 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-13 11:38:15,496 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-13 11:38:15,497 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-13 11:38:15,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,573 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-13 11:38:15,722 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:38:15,722 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-13 11:38:15,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:15,762 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-13 11:38:15,790 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-13 11:38:15,795 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-13 11:38:15,824 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-13 11:38:15,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:15,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:15,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145507581] [2022-07-13 11:38:15,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145507581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:15,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:15,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:38:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124154937] [2022-07-13 11:38:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:15,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:38:15,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:38:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:15,829 INFO L87 Difference]: Start difference. First operand 491 states and 732 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:17,846 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-13 11:38:19,852 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-13 11:38:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:26,365 INFO L93 Difference]: Finished difference Result 979 states and 1460 transitions. [2022-07-13 11:38:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:38:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-07-13 11:38:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:26,368 INFO L225 Difference]: With dead ends: 979 [2022-07-13 11:38:26,368 INFO L226 Difference]: Without dead ends: 491 [2022-07-13 11:38:26,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:38:26,369 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:26,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2022-07-13 11:38:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-13 11:38:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-13 11:38:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4918367346938775) internal successors, (731), 490 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 731 transitions. [2022-07-13 11:38:26,382 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 731 transitions. Word has length 128 [2022-07-13 11:38:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:26,383 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 731 transitions. [2022-07-13 11:38:26,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 731 transitions. [2022-07-13 11:38:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 11:38:26,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:26,384 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:26,403 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-13 11:38:26,595 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-13 11:38:26,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1330544194, now seen corresponding path program 1 times [2022-07-13 11:38:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:26,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559962901] [2022-07-13 11:38:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:26,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:38:26,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 11:38:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:27,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:38:27,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:38:27,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:27,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:27,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:27,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:27,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:38:27,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:38:27,721 INFO L356 Elim1Store]: treesize reduction 190, result has 12.8 percent of original size [2022-07-13 11:38:27,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 38 [2022-07-13 11:38:28,005 INFO L356 Elim1Store]: treesize reduction 825, result has 7.2 percent of original size [2022-07-13 11:38:28,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 86 [2022-07-13 11:38:28,370 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:38:28,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 23 [2022-07-13 11:38:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 11:38:28,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:38:28,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:38:28,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559962901] [2022-07-13 11:38:28,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559962901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:28,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:28,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650846756] [2022-07-13 11:38:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:28,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:38:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:28,393 INFO L87 Difference]: Start difference. First operand 491 states and 731 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:30,412 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-13 11:38:31,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:38,469 INFO L93 Difference]: Finished difference Result 1122 states and 1671 transitions. [2022-07-13 11:38:38,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:38,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-07-13 11:38:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:38,473 INFO L225 Difference]: With dead ends: 1122 [2022-07-13 11:38:38,473 INFO L226 Difference]: Without dead ends: 641 [2022-07-13 11:38:38,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:38,474 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 39 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:38,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 566 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 10.0s Time] [2022-07-13 11:38:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-13 11:38:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 566. [2022-07-13 11:38:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.5221238938053097) internal successors, (860), 565 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 860 transitions. [2022-07-13 11:38:38,492 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 860 transitions. Word has length 128 [2022-07-13 11:38:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:38,493 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 860 transitions. [2022-07-13 11:38:38,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 860 transitions. [2022-07-13 11:38:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 11:38:38,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:38,495 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:38,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-13 11:38:38,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:38:38,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-07-13 11:38:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:38:38,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100394141] [2022-07-13 11:38:38,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:38,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:38:38,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:38:38,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:38:38,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 11:38:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:38:43,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:38:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:38:45,342 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 11:38:45,342 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:38:45,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:38:45,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:38:45,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:38:45,547 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:45,549 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:38:45,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:38:45 BoogieIcfgContainer [2022-07-13 11:38:45,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:38:45,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:38:45,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:38:45,691 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:38:45,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:38:10" (3/4) ... [2022-07-13 11:38:45,692 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 11:38:45,770 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:38:45,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:38:45,771 INFO L158 Benchmark]: Toolchain (without parser) took 43070.44ms. Allocated memory was 50.3MB in the beginning and 79.7MB in the end (delta: 29.4MB). Free memory was 24.7MB in the beginning and 21.7MB in the end (delta: 3.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-13 11:38:45,771 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 31.8MB in the beginning and 31.8MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:38:45,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.95ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 24.6MB in the beginning and 29.0MB in the end (delta: -4.5MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-07-13 11:38:45,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.61ms. Allocated memory is still 65.0MB. Free memory was 29.0MB in the beginning and 43.4MB in the end (delta: -14.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:38:45,772 INFO L158 Benchmark]: Boogie Preprocessor took 87.99ms. Allocated memory is still 65.0MB. Free memory was 43.4MB in the beginning and 36.0MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:38:45,772 INFO L158 Benchmark]: RCFGBuilder took 6821.86ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.0MB in the beginning and 43.7MB in the end (delta: -7.6MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-07-13 11:38:45,772 INFO L158 Benchmark]: TraceAbstraction took 35415.01ms. Allocated memory is still 79.7MB. Free memory was 43.1MB in the beginning and 39.2MB in the end (delta: 3.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 11:38:45,772 INFO L158 Benchmark]: Witness Printer took 80.17ms. Allocated memory is still 79.7MB. Free memory was 38.8MB in the beginning and 21.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 11:38:45,773 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.13ms. Allocated memory is still 50.3MB. Free memory was 31.8MB in the beginning and 31.8MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.95ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 24.6MB in the beginning and 29.0MB in the end (delta: -4.5MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.61ms. Allocated memory is still 65.0MB. Free memory was 29.0MB in the beginning and 43.4MB in the end (delta: -14.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.99ms. Allocated memory is still 65.0MB. Free memory was 43.4MB in the beginning and 36.0MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 6821.86ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.0MB in the beginning and 43.7MB in the end (delta: -7.6MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35415.01ms. Allocated memory is still 79.7MB. Free memory was 43.1MB in the beginning and 39.2MB in the end (delta: 3.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 80.17ms. Allocated memory is still 79.7MB. Free memory was 38.8MB in the beginning and 21.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1737]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->cert={6:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=0, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1383] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___9=2147483648] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1618] COND TRUE blastFlag == 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1737] reach_error() VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.2s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 20.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 645 mSDsluCounter, 3347 SdHoareTripleChecker+Invalid, 20.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1789 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 75 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 1718 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4568 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 359/359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 11:38:45,828 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