./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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.11.i.cil-1.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 be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:04:25,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:04:25,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:04:25,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:04:25,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:04:25,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:04:25,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:04:25,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:04:25,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:04:25,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:04:25,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:04:25,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:04:25,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:04:25,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:04:25,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:04:25,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:04:25,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:04:25,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:04:25,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:04:25,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:04:25,088 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:04:25,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:04:25,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:04:25,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:04:25,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:04:25,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:04:25,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:04:25,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:04:25,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:04:25,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:04:25,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:04:25,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:04:25,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:04:25,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:04:25,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:04:25,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:04:25,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:04:25,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:04:25,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:04:25,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:04:25,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:04:25,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:04:25,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 11:04:25,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:04:25,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:04:25,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:04:25,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:04:25,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:04:25,130 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:04:25,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:04:25,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:04:25,131 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:04:25,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:04:25,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:04:25,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 11:04:25,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:04:25,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:04:25,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:04:25,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:04:25,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:04:25,133 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:04:25,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:04:25,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:04:25,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:04:25,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:04:25,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:04:25,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:04:25,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:04:25,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:04:25,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:04:25,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:04:25,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 11:04:25,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 11:04:25,136 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:04:25,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:04:25,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:04:25,136 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 -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2022-07-19 11:04:25,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:04:25,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:04:25,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:04:25,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:04:25,367 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:04:25,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-19 11:04:25,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd73946a2/173593a202d04f3c882950299008da7c/FLAGe83a2eb70 [2022-07-19 11:04:25,938 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:04:25,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-19 11:04:25,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd73946a2/173593a202d04f3c882950299008da7c/FLAGe83a2eb70 [2022-07-19 11:04:26,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd73946a2/173593a202d04f3c882950299008da7c [2022-07-19 11:04:26,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:04:26,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:04:26,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:04:26,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:04:26,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:04:26,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:26,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3626b007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26, skipping insertion in model container [2022-07-19 11:04:26,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:26,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:04:26,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:04:26,727 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.11.i.cil-1.c[74369,74382] [2022-07-19 11:04:26,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:04:26,757 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:04:26,854 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.11.i.cil-1.c[74369,74382] [2022-07-19 11:04:26,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:04:26,886 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:04:26,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26 WrapperNode [2022-07-19 11:04:26,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:04:26,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:04:26,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:04:26,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:04:26,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:26,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:26,969 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2022-07-19 11:04:26,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:04:26,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:04:26,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:04:26,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:04:26,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:26,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:26,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:27,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:27,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:27,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:27,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:27,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:04:27,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:04:27,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:04:27,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:04:27,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (1/1) ... [2022-07-19 11:04:27,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:04:27,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:04:27,103 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-19 11:04:27,109 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-19 11:04:27,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:04:27,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:04:27,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 11:04:27,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 11:04:27,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:04:27,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 11:04:27,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:04:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:04:27,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:04:27,322 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:04:27,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:04:27,334 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:04:29,263 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 11:04:29,263 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 11:04:29,264 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:04:29,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:04:29,269 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:04:29,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:04:29 BoogieIcfgContainer [2022-07-19 11:04:29,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:04:29,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:04:29,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:04:29,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:04:29,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:04:26" (1/3) ... [2022-07-19 11:04:29,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d58b189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:04:29, skipping insertion in model container [2022-07-19 11:04:29,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:26" (2/3) ... [2022-07-19 11:04:29,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d58b189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:04:29, skipping insertion in model container [2022-07-19 11:04:29,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:04:29" (3/3) ... [2022-07-19 11:04:29,280 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-07-19 11:04:29,290 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:04:29,291 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:04:29,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:04:29,359 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@45000aae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@104acdbe [2022-07-19 11:04:29,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:04:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 11:04:29,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:29,373 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] [2022-07-19 11:04:29,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2022-07-19 11:04:29,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:29,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713325669] [2022-07-19 11:04:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:29,840 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-19 11:04:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:29,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713325669] [2022-07-19 11:04:29,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713325669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:29,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:29,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504912657] [2022-07-19 11:04:29,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:29,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:29,871 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:30,622 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2022-07-19 11:04:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:30,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-07-19 11:04:30,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:30,632 INFO L225 Difference]: With dead ends: 421 [2022-07-19 11:04:30,632 INFO L226 Difference]: Without dead ends: 256 [2022-07-19 11:04:30,634 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-19 11:04:30,636 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:30,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 11:04:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-19 11:04:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-07-19 11:04:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2022-07-19 11:04:30,684 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2022-07-19 11:04:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:30,684 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2022-07-19 11:04:30,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2022-07-19 11:04:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 11:04:30,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:30,686 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] [2022-07-19 11:04:30,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 11:04:30,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591931, now seen corresponding path program 1 times [2022-07-19 11:04:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:30,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714392928] [2022-07-19 11:04:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:30,845 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-19 11:04:30,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:30,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714392928] [2022-07-19 11:04:30,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714392928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:30,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:30,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:30,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946854008] [2022-07-19 11:04:30,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:30,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:30,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:30,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:30,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:30,848 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:31,555 INFO L93 Difference]: Finished difference Result 439 states and 692 transitions. [2022-07-19 11:04:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:31,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-07-19 11:04:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:31,557 INFO L225 Difference]: With dead ends: 439 [2022-07-19 11:04:31,557 INFO L226 Difference]: Without dead ends: 284 [2022-07-19 11:04:31,558 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-19 11:04:31,559 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 134 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:31,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 11:04:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-19 11:04:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 194. [2022-07-19 11:04:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 312 transitions. [2022-07-19 11:04:31,600 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 312 transitions. Word has length 38 [2022-07-19 11:04:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:31,602 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 312 transitions. [2022-07-19 11:04:31,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 312 transitions. [2022-07-19 11:04:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 11:04:31,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:31,605 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] [2022-07-19 11:04:31,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 11:04:31,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 917746377, now seen corresponding path program 1 times [2022-07-19 11:04:31,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:31,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535737967] [2022-07-19 11:04:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:31,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:31,704 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-19 11:04:31,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:31,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535737967] [2022-07-19 11:04:31,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535737967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:31,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:31,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:31,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844115452] [2022-07-19 11:04:31,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:31,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:31,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:31,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:31,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:31,707 INFO L87 Difference]: Start difference. First operand 194 states and 312 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:32,252 INFO L93 Difference]: Finished difference Result 406 states and 651 transitions. [2022-07-19 11:04:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:32,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-07-19 11:04:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:32,254 INFO L225 Difference]: With dead ends: 406 [2022-07-19 11:04:32,254 INFO L226 Difference]: Without dead ends: 222 [2022-07-19 11:04:32,256 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-19 11:04:32,257 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:32,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 11:04:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-19 11:04:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2022-07-19 11:04:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6225490196078431) internal successors, (331), 204 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 331 transitions. [2022-07-19 11:04:32,266 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 331 transitions. Word has length 44 [2022-07-19 11:04:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:32,267 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 331 transitions. [2022-07-19 11:04:32,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 331 transitions. [2022-07-19 11:04:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 11:04:32,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:32,269 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] [2022-07-19 11:04:32,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 11:04:32,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:32,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash 868700126, now seen corresponding path program 1 times [2022-07-19 11:04:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:32,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684457866] [2022-07-19 11:04:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:32,393 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-19 11:04:32,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:32,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684457866] [2022-07-19 11:04:32,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684457866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:32,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:32,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40752455] [2022-07-19 11:04:32,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:32,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:32,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:32,398 INFO L87 Difference]: Start difference. First operand 205 states and 331 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:32,824 INFO L93 Difference]: Finished difference Result 406 states and 650 transitions. [2022-07-19 11:04:32,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:32,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-07-19 11:04:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:32,826 INFO L225 Difference]: With dead ends: 406 [2022-07-19 11:04:32,826 INFO L226 Difference]: Without dead ends: 222 [2022-07-19 11:04:32,826 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-19 11:04:32,827 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:32,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 471 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 11:04:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-19 11:04:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2022-07-19 11:04:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 204 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 330 transitions. [2022-07-19 11:04:32,844 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 330 transitions. Word has length 57 [2022-07-19 11:04:32,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:32,845 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 330 transitions. [2022-07-19 11:04:32,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 330 transitions. [2022-07-19 11:04:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 11:04:32,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:32,850 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] [2022-07-19 11:04:32,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 11:04:32,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 642771885, now seen corresponding path program 1 times [2022-07-19 11:04:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:32,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91508250] [2022-07-19 11:04:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:32,934 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-19 11:04:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:32,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91508250] [2022-07-19 11:04:32,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91508250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:32,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:32,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955795866] [2022-07-19 11:04:32,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:32,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:32,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:32,936 INFO L87 Difference]: Start difference. First operand 205 states and 330 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:33,400 INFO L93 Difference]: Finished difference Result 405 states and 648 transitions. [2022-07-19 11:04:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:33,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-19 11:04:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:33,401 INFO L225 Difference]: With dead ends: 405 [2022-07-19 11:04:33,402 INFO L226 Difference]: Without dead ends: 221 [2022-07-19 11:04:33,402 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-19 11:04:33,403 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 28 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:33,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 11:04:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-19 11:04:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205. [2022-07-19 11:04:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.6127450980392157) internal successors, (329), 204 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 329 transitions. [2022-07-19 11:04:33,409 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 329 transitions. Word has length 58 [2022-07-19 11:04:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:33,409 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 329 transitions. [2022-07-19 11:04:33,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 329 transitions. [2022-07-19 11:04:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 11:04:33,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:33,410 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] [2022-07-19 11:04:33,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 11:04:33,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash -404738919, now seen corresponding path program 1 times [2022-07-19 11:04:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:33,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550209672] [2022-07-19 11:04:33,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:33,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:33,489 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-19 11:04:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:33,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550209672] [2022-07-19 11:04:33,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550209672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:33,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:33,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838195709] [2022-07-19 11:04:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:33,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:33,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:33,491 INFO L87 Difference]: Start difference. First operand 205 states and 329 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:34,174 INFO L93 Difference]: Finished difference Result 479 states and 760 transitions. [2022-07-19 11:04:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:34,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-19 11:04:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:34,175 INFO L225 Difference]: With dead ends: 479 [2022-07-19 11:04:34,175 INFO L226 Difference]: Without dead ends: 295 [2022-07-19 11:04:34,176 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-19 11:04:34,176 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 150 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:34,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 330 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 11:04:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-19 11:04:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 205. [2022-07-19 11:04:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5980392156862746) internal successors, (326), 204 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 326 transitions. [2022-07-19 11:04:34,181 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 326 transitions. Word has length 58 [2022-07-19 11:04:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:34,181 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 326 transitions. [2022-07-19 11:04:34,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 326 transitions. [2022-07-19 11:04:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 11:04:34,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:34,182 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] [2022-07-19 11:04:34,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 11:04:34,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:34,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1540605214, now seen corresponding path program 1 times [2022-07-19 11:04:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:34,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845649332] [2022-07-19 11:04:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:34,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:04:34,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:34,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845649332] [2022-07-19 11:04:34,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845649332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:34,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:34,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:34,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42358200] [2022-07-19 11:04:34,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:34,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:34,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:34,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:34,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:34,343 INFO L87 Difference]: Start difference. First operand 205 states and 326 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:34,832 INFO L93 Difference]: Finished difference Result 478 states and 754 transitions. [2022-07-19 11:04:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:34,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-19 11:04:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:34,833 INFO L225 Difference]: With dead ends: 478 [2022-07-19 11:04:34,834 INFO L226 Difference]: Without dead ends: 294 [2022-07-19 11:04:34,834 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-19 11:04:34,834 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:34,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 11:04:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-19 11:04:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-19 11:04:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5833333333333333) internal successors, (323), 204 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 323 transitions. [2022-07-19 11:04:34,844 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 323 transitions. Word has length 58 [2022-07-19 11:04:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:34,844 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 323 transitions. [2022-07-19 11:04:34,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 323 transitions. [2022-07-19 11:04:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 11:04:34,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:34,846 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] [2022-07-19 11:04:34,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 11:04:34,847 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash -219751902, now seen corresponding path program 1 times [2022-07-19 11:04:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:34,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227221841] [2022-07-19 11:04:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:34,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:34,993 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-19 11:04:34,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:34,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227221841] [2022-07-19 11:04:34,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227221841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:34,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:34,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:34,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110190562] [2022-07-19 11:04:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:34,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:34,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:34,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:34,996 INFO L87 Difference]: Start difference. First operand 205 states and 323 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:35,741 INFO L93 Difference]: Finished difference Result 478 states and 749 transitions. [2022-07-19 11:04:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:35,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-19 11:04:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:35,743 INFO L225 Difference]: With dead ends: 478 [2022-07-19 11:04:35,743 INFO L226 Difference]: Without dead ends: 294 [2022-07-19 11:04:35,743 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-19 11:04:35,744 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:35,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 11:04:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-19 11:04:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-19 11:04:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5686274509803921) internal successors, (320), 204 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2022-07-19 11:04:35,749 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 58 [2022-07-19 11:04:35,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:35,749 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2022-07-19 11:04:35,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2022-07-19 11:04:35,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 11:04:35,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:35,750 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] [2022-07-19 11:04:35,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 11:04:35,750 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:35,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:35,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1716593643, now seen corresponding path program 1 times [2022-07-19 11:04:35,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:35,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26592696] [2022-07-19 11:04:35,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:35,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:35,820 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-19 11:04:35,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:35,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26592696] [2022-07-19 11:04:35,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26592696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:35,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:35,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457595424] [2022-07-19 11:04:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:35,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:35,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:35,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:35,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:35,822 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:36,368 INFO L93 Difference]: Finished difference Result 478 states and 744 transitions. [2022-07-19 11:04:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:36,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-19 11:04:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:36,370 INFO L225 Difference]: With dead ends: 478 [2022-07-19 11:04:36,370 INFO L226 Difference]: Without dead ends: 294 [2022-07-19 11:04:36,371 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-19 11:04:36,371 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 146 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:36,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 11:04:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-19 11:04:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-19 11:04:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.553921568627451) internal successors, (317), 204 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2022-07-19 11:04:36,376 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 317 transitions. Word has length 59 [2022-07-19 11:04:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:36,376 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 317 transitions. [2022-07-19 11:04:36,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 317 transitions. [2022-07-19 11:04:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 11:04:36,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:36,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:04:36,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 11:04:36,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1056186316, now seen corresponding path program 1 times [2022-07-19 11:04:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:36,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491414229] [2022-07-19 11:04:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:04:36,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:36,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491414229] [2022-07-19 11:04:36,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491414229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:36,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:36,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:36,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270793141] [2022-07-19 11:04:36,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:36,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:36,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:36,448 INFO L87 Difference]: Start difference. First operand 205 states and 317 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:36,949 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2022-07-19 11:04:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:36,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-19 11:04:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:36,951 INFO L225 Difference]: With dead ends: 402 [2022-07-19 11:04:36,951 INFO L226 Difference]: Without dead ends: 218 [2022-07-19 11:04:36,951 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-19 11:04:36,952 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:36,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 11:04:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-19 11:04:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2022-07-19 11:04:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5490196078431373) internal successors, (316), 204 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 316 transitions. [2022-07-19 11:04:36,955 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 316 transitions. Word has length 60 [2022-07-19 11:04:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:36,956 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 316 transitions. [2022-07-19 11:04:36,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 316 transitions. [2022-07-19 11:04:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 11:04:36,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:36,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:04:36,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 11:04:36,956 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:36,957 INFO L85 PathProgramCache]: Analyzing trace with hash 614802448, now seen corresponding path program 1 times [2022-07-19 11:04:36,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:36,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450073057] [2022-07-19 11:04:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:36,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:04:37,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:37,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450073057] [2022-07-19 11:04:37,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450073057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:37,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:37,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371102] [2022-07-19 11:04:37,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:37,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:37,039 INFO L87 Difference]: Start difference. First operand 205 states and 316 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-19 11:04:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:37,540 INFO L93 Difference]: Finished difference Result 478 states and 738 transitions. [2022-07-19 11:04:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:37,541 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-19 11:04:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:37,542 INFO L225 Difference]: With dead ends: 478 [2022-07-19 11:04:37,542 INFO L226 Difference]: Without dead ends: 294 [2022-07-19 11:04:37,542 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-19 11:04:37,542 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 143 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:37,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 11:04:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-19 11:04:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2022-07-19 11:04:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5343137254901962) internal successors, (313), 204 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 313 transitions. [2022-07-19 11:04:37,547 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 313 transitions. Word has length 61 [2022-07-19 11:04:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:37,547 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 313 transitions. [2022-07-19 11:04:37,547 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-19 11:04:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 313 transitions. [2022-07-19 11:04:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 11:04:37,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:37,548 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] [2022-07-19 11:04:37,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 11:04:37,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:37,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1287801256, now seen corresponding path program 1 times [2022-07-19 11:04:37,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:37,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718450534] [2022-07-19 11:04:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:37,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:37,628 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-19 11:04:37,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:37,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718450534] [2022-07-19 11:04:37,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718450534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:37,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:37,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:37,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210710845] [2022-07-19 11:04:37,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:37,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:37,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:37,630 INFO L87 Difference]: Start difference. First operand 205 states and 313 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-19 11:04:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:38,713 INFO L93 Difference]: Finished difference Result 508 states and 780 transitions. [2022-07-19 11:04:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:38,714 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-19 11:04:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:38,715 INFO L225 Difference]: With dead ends: 508 [2022-07-19 11:04:38,715 INFO L226 Difference]: Without dead ends: 324 [2022-07-19 11:04:38,715 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-19 11:04:38,716 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 119 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:38,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 11:04:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-19 11:04:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 245. [2022-07-19 11:04:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.5532786885245902) internal successors, (379), 244 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions. [2022-07-19 11:04:38,721 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 61 [2022-07-19 11:04:38,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:38,722 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions. [2022-07-19 11:04:38,722 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-19 11:04:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions. [2022-07-19 11:04:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:04:38,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:38,723 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] [2022-07-19 11:04:38,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 11:04:38,723 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:38,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1049026987, now seen corresponding path program 1 times [2022-07-19 11:04:38,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:38,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249639328] [2022-07-19 11:04:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:38,821 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-19 11:04:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:38,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249639328] [2022-07-19 11:04:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249639328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:38,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:38,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:38,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653594939] [2022-07-19 11:04:38,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:38,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:38,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:38,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:38,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:38,823 INFO L87 Difference]: Start difference. First operand 245 states and 379 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-19 11:04:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:39,467 INFO L93 Difference]: Finished difference Result 511 states and 793 transitions. [2022-07-19 11:04:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:39,468 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-19 11:04:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:39,469 INFO L225 Difference]: With dead ends: 511 [2022-07-19 11:04:39,469 INFO L226 Difference]: Without dead ends: 287 [2022-07-19 11:04:39,470 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-19 11:04:39,470 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 29 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:39,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 493 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 11:04:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-19 11:04:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 267. [2022-07-19 11:04:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5488721804511278) internal successors, (412), 266 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 412 transitions. [2022-07-19 11:04:39,475 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 412 transitions. Word has length 62 [2022-07-19 11:04:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:39,476 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 412 transitions. [2022-07-19 11:04:39,476 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-19 11:04:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 412 transitions. [2022-07-19 11:04:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-19 11:04:39,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:39,477 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 11:04:39,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 11:04:39,478 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:39,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1947485908, now seen corresponding path program 1 times [2022-07-19 11:04:39,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:39,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934008144] [2022-07-19 11:04:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:04:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:39,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934008144] [2022-07-19 11:04:39,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934008144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:39,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:39,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:39,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028245267] [2022-07-19 11:04:39,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:39,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:39,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:39,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:39,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:39,569 INFO L87 Difference]: Start difference. First operand 267 states and 412 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:40,286 INFO L93 Difference]: Finished difference Result 531 states and 823 transitions. [2022-07-19 11:04:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-07-19 11:04:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:40,288 INFO L225 Difference]: With dead ends: 531 [2022-07-19 11:04:40,288 INFO L226 Difference]: Without dead ends: 285 [2022-07-19 11:04:40,289 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-19 11:04:40,289 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 34 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:40,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 11:04:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-19 11:04:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 267. [2022-07-19 11:04:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5451127819548873) internal successors, (411), 266 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2022-07-19 11:04:40,294 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 75 [2022-07-19 11:04:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:40,294 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2022-07-19 11:04:40,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2022-07-19 11:04:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-19 11:04:40,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:40,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:04:40,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 11:04:40,295 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash -655331449, now seen corresponding path program 1 times [2022-07-19 11:04:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383652214] [2022-07-19 11:04:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:04:40,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:40,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383652214] [2022-07-19 11:04:40,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383652214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:40,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:40,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356557759] [2022-07-19 11:04:40,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:40,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:40,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:40,391 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-19 11:04:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:40,791 INFO L93 Difference]: Finished difference Result 530 states and 820 transitions. [2022-07-19 11:04:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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 76 [2022-07-19 11:04:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:40,792 INFO L225 Difference]: With dead ends: 530 [2022-07-19 11:04:40,793 INFO L226 Difference]: Without dead ends: 284 [2022-07-19 11:04:40,793 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-19 11:04:40,793 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 38 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:40,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 499 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 11:04:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-19 11:04:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 267. [2022-07-19 11:04:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5413533834586466) internal successors, (410), 266 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions. [2022-07-19 11:04:40,798 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 76 [2022-07-19 11:04:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:40,798 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions. [2022-07-19 11:04:40,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-19 11:04:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions. [2022-07-19 11:04:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-19 11:04:40,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:40,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2022-07-19 11:04:40,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 11:04:40,801 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash 280248224, now seen corresponding path program 1 times [2022-07-19 11:04:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:40,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048145411] [2022-07-19 11:04:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:04:40,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:40,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048145411] [2022-07-19 11:04:40,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048145411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:40,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:40,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:40,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625193457] [2022-07-19 11:04:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:40,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:40,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:40,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:40,920 INFO L87 Difference]: Start difference. First operand 267 states and 410 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:41,710 INFO L93 Difference]: Finished difference Result 602 states and 927 transitions. [2022-07-19 11:04:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:41,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-07-19 11:04:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:41,712 INFO L225 Difference]: With dead ends: 602 [2022-07-19 11:04:41,712 INFO L226 Difference]: Without dead ends: 356 [2022-07-19 11:04:41,713 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-19 11:04:41,713 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 144 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:41,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 334 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 11:04:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-19 11:04:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 267. [2022-07-19 11:04:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5263157894736843) internal successors, (406), 266 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 406 transitions. [2022-07-19 11:04:41,718 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 406 transitions. Word has length 78 [2022-07-19 11:04:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:41,718 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 406 transitions. [2022-07-19 11:04:41,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 406 transitions. [2022-07-19 11:04:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 11:04:41,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:41,720 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] [2022-07-19 11:04:41,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 11:04:41,720 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1344832479, now seen corresponding path program 1 times [2022-07-19 11:04:41,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:41,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886871614] [2022-07-19 11:04:41,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:41,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:41,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-19 11:04:41,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:41,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886871614] [2022-07-19 11:04:41,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886871614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:41,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:41,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:41,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160387214] [2022-07-19 11:04:41,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:41,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:41,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:41,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:41,825 INFO L87 Difference]: Start difference. First operand 267 states and 406 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:42,458 INFO L93 Difference]: Finished difference Result 603 states and 918 transitions. [2022-07-19 11:04:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:42,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 84 [2022-07-19 11:04:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:42,460 INFO L225 Difference]: With dead ends: 603 [2022-07-19 11:04:42,460 INFO L226 Difference]: Without dead ends: 357 [2022-07-19 11:04:42,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:04:42,461 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 67 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:42,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 469 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 11:04:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-07-19 11:04:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 309. [2022-07-19 11:04:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5357142857142858) internal successors, (473), 308 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-07-19 11:04:42,466 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 84 [2022-07-19 11:04:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:42,466 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-07-19 11:04:42,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-07-19 11:04:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 11:04:42,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:42,467 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] [2022-07-19 11:04:42,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 11:04:42,468 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -921185757, now seen corresponding path program 1 times [2022-07-19 11:04:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068509648] [2022-07-19 11:04:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:42,539 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-19 11:04:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:42,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068509648] [2022-07-19 11:04:42,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068509648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:42,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:42,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004673022] [2022-07-19 11:04:42,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:42,541 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:43,116 INFO L93 Difference]: Finished difference Result 646 states and 991 transitions. [2022-07-19 11:04:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:43,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 84 [2022-07-19 11:04:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:43,118 INFO L225 Difference]: With dead ends: 646 [2022-07-19 11:04:43,118 INFO L226 Difference]: Without dead ends: 358 [2022-07-19 11:04:43,119 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-19 11:04:43,119 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:43,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 591 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 11:04:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-19 11:04:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 333. [2022-07-19 11:04:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.533132530120482) internal successors, (509), 332 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 509 transitions. [2022-07-19 11:04:43,134 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 509 transitions. Word has length 84 [2022-07-19 11:04:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:43,134 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 509 transitions. [2022-07-19 11:04:43,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 509 transitions. [2022-07-19 11:04:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-19 11:04:43,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:43,135 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-19 11:04:43,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 11:04:43,135 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 742972446, now seen corresponding path program 1 times [2022-07-19 11:04:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:43,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081469180] [2022-07-19 11:04:43,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:04:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:43,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081469180] [2022-07-19 11:04:43,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081469180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:43,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:43,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:43,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341507257] [2022-07-19 11:04:43,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:43,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:43,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:43,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:43,241 INFO L87 Difference]: Start difference. First operand 333 states and 509 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:44,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:04:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:44,780 INFO L93 Difference]: Finished difference Result 771 states and 1187 transitions. [2022-07-19 11:04:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:44,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-19 11:04:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:44,782 INFO L225 Difference]: With dead ends: 771 [2022-07-19 11:04:44,782 INFO L226 Difference]: Without dead ends: 459 [2022-07-19 11:04:44,783 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-19 11:04:44,783 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 141 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:44,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 11:04:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-07-19 11:04:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 349. [2022-07-19 11:04:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.514367816091954) internal successors, (527), 348 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 527 transitions. [2022-07-19 11:04:44,789 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 527 transitions. Word has length 97 [2022-07-19 11:04:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:44,789 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 527 transitions. [2022-07-19 11:04:44,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 527 transitions. [2022-07-19 11:04:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 11:04:44,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:44,790 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 11:04:44,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 11:04:44,791 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash 659456893, now seen corresponding path program 1 times [2022-07-19 11:04:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:44,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609325212] [2022-07-19 11:04:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:04:44,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:44,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609325212] [2022-07-19 11:04:44,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609325212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:44,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:44,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444551569] [2022-07-19 11:04:44,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:44,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:44,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:44,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:44,912 INFO L87 Difference]: Start difference. First operand 349 states and 527 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:45,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:04:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:46,217 INFO L93 Difference]: Finished difference Result 755 states and 1147 transitions. [2022-07-19 11:04:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 98 [2022-07-19 11:04:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:46,219 INFO L225 Difference]: With dead ends: 755 [2022-07-19 11:04:46,219 INFO L226 Difference]: Without dead ends: 427 [2022-07-19 11:04:46,219 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-19 11:04:46,220 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 139 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:46,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 356 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 11:04:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-07-19 11:04:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349. [2022-07-19 11:04:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4971264367816093) internal successors, (521), 348 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 521 transitions. [2022-07-19 11:04:46,225 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 521 transitions. Word has length 98 [2022-07-19 11:04:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:46,225 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 521 transitions. [2022-07-19 11:04:46,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 521 transitions. [2022-07-19 11:04:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-19 11:04:46,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:46,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:04:46,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 11:04:46,226 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 280390343, now seen corresponding path program 1 times [2022-07-19 11:04:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:46,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908678959] [2022-07-19 11:04:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:46,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:04:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:46,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908678959] [2022-07-19 11:04:46,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908678959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:46,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:46,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169999604] [2022-07-19 11:04:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:46,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:46,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:46,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:46,320 INFO L87 Difference]: Start difference. First operand 349 states and 521 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:48,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:04:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:48,441 INFO L93 Difference]: Finished difference Result 712 states and 1064 transitions. [2022-07-19 11:04:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 104 [2022-07-19 11:04:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:48,442 INFO L225 Difference]: With dead ends: 712 [2022-07-19 11:04:48,442 INFO L226 Difference]: Without dead ends: 384 [2022-07-19 11:04:48,443 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-19 11:04:48,443 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 71 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:48,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 489 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 11:04:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-19 11:04:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 349. [2022-07-19 11:04:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4942528735632183) internal successors, (520), 348 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 520 transitions. [2022-07-19 11:04:48,449 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 520 transitions. Word has length 104 [2022-07-19 11:04:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:48,450 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 520 transitions. [2022-07-19 11:04:48,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 520 transitions. [2022-07-19 11:04:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 11:04:48,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:48,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:04:48,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 11:04:48,451 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:48,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 509759261, now seen corresponding path program 1 times [2022-07-19 11:04:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:48,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881113935] [2022-07-19 11:04:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:04:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:48,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881113935] [2022-07-19 11:04:48,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881113935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:48,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:48,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947041687] [2022-07-19 11:04:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:48,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:48,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:48,562 INFO L87 Difference]: Start difference. First operand 349 states and 520 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:49,148 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2022-07-19 11:04:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:49,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-19 11:04:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:49,149 INFO L225 Difference]: With dead ends: 710 [2022-07-19 11:04:49,149 INFO L226 Difference]: Without dead ends: 382 [2022-07-19 11:04:49,150 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-19 11:04:49,150 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 68 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:49,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 495 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 11:04:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-19 11:04:49,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 349. [2022-07-19 11:04:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4913793103448276) internal successors, (519), 348 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 519 transitions. [2022-07-19 11:04:49,156 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 519 transitions. Word has length 105 [2022-07-19 11:04:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:49,156 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 519 transitions. [2022-07-19 11:04:49,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 519 transitions. [2022-07-19 11:04:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 11:04:49,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:49,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:04:49,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 11:04:49,157 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:49,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:49,157 INFO L85 PathProgramCache]: Analyzing trace with hash -213108826, now seen corresponding path program 1 times [2022-07-19 11:04:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:49,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305230388] [2022-07-19 11:04:49,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:49,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:04:49,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:49,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305230388] [2022-07-19 11:04:49,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305230388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:49,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:49,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:49,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348202139] [2022-07-19 11:04:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:49,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:49,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:49,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:49,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:49,234 INFO L87 Difference]: Start difference. First operand 349 states and 519 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:50,011 INFO L93 Difference]: Finished difference Result 707 states and 1053 transitions. [2022-07-19 11:04:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:50,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-19 11:04:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:50,014 INFO L225 Difference]: With dead ends: 707 [2022-07-19 11:04:50,014 INFO L226 Difference]: Without dead ends: 379 [2022-07-19 11:04:50,014 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-19 11:04:50,015 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:50,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 501 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 11:04:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-19 11:04:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 349. [2022-07-19 11:04:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4885057471264367) internal successors, (518), 348 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 518 transitions. [2022-07-19 11:04:50,021 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 518 transitions. Word has length 105 [2022-07-19 11:04:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:50,022 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 518 transitions. [2022-07-19 11:04:50,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 518 transitions. [2022-07-19 11:04:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:04:50,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:50,023 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-19 11:04:50,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 11:04:50,023 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:50,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1295545029, now seen corresponding path program 1 times [2022-07-19 11:04:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:50,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261927450] [2022-07-19 11:04:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:50,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:04:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261927450] [2022-07-19 11:04:50,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261927450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:50,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:50,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:04:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891448031] [2022-07-19 11:04:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:50,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:04:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:04:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:04:50,104 INFO L87 Difference]: Start difference. First operand 349 states and 518 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:50,794 INFO L93 Difference]: Finished difference Result 755 states and 1129 transitions. [2022-07-19 11:04:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:04:50,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:04:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:50,796 INFO L225 Difference]: With dead ends: 755 [2022-07-19 11:04:50,796 INFO L226 Difference]: Without dead ends: 427 [2022-07-19 11:04:50,796 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-19 11:04:50,796 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 125 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:50,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 368 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 11:04:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-07-19 11:04:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 349. [2022-07-19 11:04:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4770114942528736) internal successors, (514), 348 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 514 transitions. [2022-07-19 11:04:50,802 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 514 transitions. Word has length 106 [2022-07-19 11:04:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:50,802 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 514 transitions. [2022-07-19 11:04:50,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 514 transitions. [2022-07-19 11:04:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:04:50,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:50,803 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-19 11:04:50,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 11:04:50,804 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash 878148423, now seen corresponding path program 1 times [2022-07-19 11:04:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:50,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839427038] [2022-07-19 11:04:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 11:04:50,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:50,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839427038] [2022-07-19 11:04:50,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839427038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:50,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:50,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:04:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950698605] [2022-07-19 11:04:50,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:50,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:04:50,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:50,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:04:50,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:04:50,876 INFO L87 Difference]: Start difference. First operand 349 states and 514 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:50,906 INFO L93 Difference]: Finished difference Result 1000 states and 1488 transitions. [2022-07-19 11:04:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:04:50,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:04:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:50,909 INFO L225 Difference]: With dead ends: 1000 [2022-07-19 11:04:50,909 INFO L226 Difference]: Without dead ends: 672 [2022-07-19 11:04:50,909 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-19 11:04:50,910 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 136 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:50,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:04:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-19 11:04:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2022-07-19 11:04:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.473919523099851) internal successors, (989), 671 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 989 transitions. [2022-07-19 11:04:50,920 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 989 transitions. Word has length 106 [2022-07-19 11:04:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:50,939 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 989 transitions. [2022-07-19 11:04:50,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 989 transitions. [2022-07-19 11:04:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:04:50,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:50,940 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-19 11:04:50,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 11:04:50,941 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:50,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash -808031415, now seen corresponding path program 1 times [2022-07-19 11:04:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:50,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568748406] [2022-07-19 11:04:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 11:04:51,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:51,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568748406] [2022-07-19 11:04:51,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568748406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:51,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:51,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:04:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288964747] [2022-07-19 11:04:51,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:51,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:04:51,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:51,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:04:51,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:04:51,004 INFO L87 Difference]: Start difference. First operand 672 states and 989 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:51,027 INFO L93 Difference]: Finished difference Result 1350 states and 1990 transitions. [2022-07-19 11:04:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:04:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:04:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:51,029 INFO L225 Difference]: With dead ends: 1350 [2022-07-19 11:04:51,029 INFO L226 Difference]: Without dead ends: 699 [2022-07-19 11:04:51,030 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-19 11:04:51,030 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:51,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:04:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-07-19 11:04:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2022-07-19 11:04:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.4670487106017192) internal successors, (1024), 698 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1024 transitions. [2022-07-19 11:04:51,040 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1024 transitions. Word has length 106 [2022-07-19 11:04:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:51,040 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 1024 transitions. [2022-07-19 11:04:51,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1024 transitions. [2022-07-19 11:04:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 11:04:51,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:51,042 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-19 11:04:51,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 11:04:51,042 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1068451403, now seen corresponding path program 1 times [2022-07-19 11:04:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:51,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838753010] [2022-07-19 11:04:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-19 11:04:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:51,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838753010] [2022-07-19 11:04:51,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838753010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:51,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:51,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:04:51,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523426956] [2022-07-19 11:04:51,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:51,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:04:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:51,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:04:51,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:04:51,108 INFO L87 Difference]: Start difference. First operand 699 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:51,127 INFO L93 Difference]: Finished difference Result 1379 states and 2026 transitions. [2022-07-19 11:04:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:04:51,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-19 11:04:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:51,129 INFO L225 Difference]: With dead ends: 1379 [2022-07-19 11:04:51,129 INFO L226 Difference]: Without dead ends: 701 [2022-07-19 11:04:51,130 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-19 11:04:51,130 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:51,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:04:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-07-19 11:04:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2022-07-19 11:04:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 1.4657142857142857) internal successors, (1026), 700 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1026 transitions. [2022-07-19 11:04:51,140 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1026 transitions. Word has length 106 [2022-07-19 11:04:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:51,140 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1026 transitions. [2022-07-19 11:04:51,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1026 transitions. [2022-07-19 11:04:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 11:04:51,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:51,141 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-19 11:04:51,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 11:04:51,142 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash -414944271, now seen corresponding path program 1 times [2022-07-19 11:04:51,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:51,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242958784] [2022-07-19 11:04:51,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 11:04:51,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:51,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242958784] [2022-07-19 11:04:51,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242958784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:51,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:51,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:04:51,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886850984] [2022-07-19 11:04:51,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:51,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:04:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:04:51,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:04:51,234 INFO L87 Difference]: Start difference. First operand 701 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-19 11:04:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:51,272 INFO L93 Difference]: Finished difference Result 1707 states and 2514 transitions. [2022-07-19 11:04:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:04:51,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-19 11:04:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:51,275 INFO L225 Difference]: With dead ends: 1707 [2022-07-19 11:04:51,275 INFO L226 Difference]: Without dead ends: 1029 [2022-07-19 11:04:51,276 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-19 11:04:51,276 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:51,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:04:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2022-07-19 11:04:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1027. [2022-07-19 11:04:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4688109161793372) internal successors, (1507), 1026 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1507 transitions. [2022-07-19 11:04:51,292 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1507 transitions. Word has length 108 [2022-07-19 11:04:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:51,292 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1507 transitions. [2022-07-19 11:04:51,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-19 11:04:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1507 transitions. [2022-07-19 11:04:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 11:04:51,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:51,294 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, 1, 1, 1, 1, 1, 1, 1, 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-19 11:04:51,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 11:04:51,294 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:51,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2063160218, now seen corresponding path program 1 times [2022-07-19 11:04:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:51,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949181387] [2022-07-19 11:04:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 11:04:51,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:51,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949181387] [2022-07-19 11:04:51,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949181387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:51,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:51,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:04:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802798048] [2022-07-19 11:04:51,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:51,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:04:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:04:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:04:51,378 INFO L87 Difference]: Start difference. First operand 1027 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:51,418 INFO L93 Difference]: Finished difference Result 2353 states and 3470 transitions. [2022-07-19 11:04:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:04:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-07-19 11:04:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:51,422 INFO L225 Difference]: With dead ends: 2353 [2022-07-19 11:04:51,422 INFO L226 Difference]: Without dead ends: 1349 [2022-07-19 11:04:51,423 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-19 11:04:51,426 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:51,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:04:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-07-19 11:04:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2022-07-19 11:04:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.4688427299703264) internal successors, (1980), 1348 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1980 transitions. [2022-07-19 11:04:51,447 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1980 transitions. Word has length 125 [2022-07-19 11:04:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:51,447 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1980 transitions. [2022-07-19 11:04:51,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1980 transitions. [2022-07-19 11:04:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 11:04:51,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:51,449 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-19 11:04:51,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 11:04:51,449 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash 726227607, now seen corresponding path program 1 times [2022-07-19 11:04:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:51,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489103168] [2022-07-19 11:04:51,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 11:04:51,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489103168] [2022-07-19 11:04:51,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489103168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:51,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:51,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:04:51,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391650031] [2022-07-19 11:04:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:51,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:04:51,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:04:51,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:04:51,565 INFO L87 Difference]: Start difference. First operand 1349 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-19 11:04:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:51,602 INFO L93 Difference]: Finished difference Result 2005 states and 2944 transitions. [2022-07-19 11:04:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:04:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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 128 [2022-07-19 11:04:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:51,606 INFO L225 Difference]: With dead ends: 2005 [2022-07-19 11:04:51,606 INFO L226 Difference]: Without dead ends: 1677 [2022-07-19 11:04:51,607 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-19 11:04:51,608 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 157 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:51,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 373 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:04:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-07-19 11:04:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1675. [2022-07-19 11:04:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.467741935483871) internal successors, (2457), 1674 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2457 transitions. [2022-07-19 11:04:51,645 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2457 transitions. Word has length 128 [2022-07-19 11:04:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:51,645 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2457 transitions. [2022-07-19 11:04:51,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-19 11:04:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2457 transitions. [2022-07-19 11:04:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 11:04:51,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:51,649 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-19 11:04:51,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 11:04:51,649 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1329906676, now seen corresponding path program 1 times [2022-07-19 11:04:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:51,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197359300] [2022-07-19 11:04:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:04:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-19 11:04:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:04:51,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197359300] [2022-07-19 11:04:51,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197359300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:04:51,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:04:51,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 11:04:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730768646] [2022-07-19 11:04:51,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:04:51,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 11:04:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:04:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 11:04:51,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:04:51,984 INFO L87 Difference]: Start difference. First operand 1675 states and 2457 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-19 11:04:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:04:53,146 INFO L93 Difference]: Finished difference Result 3347 states and 4910 transitions. [2022-07-19 11:04:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 11:04:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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 129 [2022-07-19 11:04:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:04:53,152 INFO L225 Difference]: With dead ends: 3347 [2022-07-19 11:04:53,152 INFO L226 Difference]: Without dead ends: 1675 [2022-07-19 11:04:53,153 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-19 11:04:53,154 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:04:53,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 11:04:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-07-19 11:04:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2022-07-19 11:04:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.4671445639187575) internal successors, (2456), 1674 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:04:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2456 transitions. [2022-07-19 11:04:53,179 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2456 transitions. Word has length 129 [2022-07-19 11:04:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:04:53,180 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 2456 transitions. [2022-07-19 11:04:53,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-19 11:04:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2456 transitions. [2022-07-19 11:04:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 11:04:53,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:04:53,182 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-19 11:04:53,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 11:04:53,182 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:04:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:04:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2022-07-19 11:04:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:04:53,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473043420] [2022-07-19 11:04:53,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:04:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:04:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:04:53,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:04:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:04:54,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 11:04:54,081 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:04:54,082 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:04:54,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 11:04:54,088 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:04:54,090 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:04:54,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:04:54 BoogieIcfgContainer [2022-07-19 11:04:54,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:04:54,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:04:54,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:04:54,228 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:04:54,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:04:29" (3/4) ... [2022-07-19 11:04:54,231 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 11:04:54,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:04:54,231 INFO L158 Benchmark]: Toolchain (without parser) took 27835.24ms. Allocated memory was 104.9MB in the beginning and 268.4MB in the end (delta: 163.6MB). Free memory was 79.5MB in the beginning and 213.5MB in the end (delta: -134.0MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-07-19 11:04:54,231 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:04:54,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.10ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 79.1MB in the beginning and 80.0MB in the end (delta: -929.1kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-19 11:04:54,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.81ms. Allocated memory is still 125.8MB. Free memory was 80.0MB in the beginning and 75.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 11:04:54,234 INFO L158 Benchmark]: Boogie Preprocessor took 85.61ms. Allocated memory is still 125.8MB. Free memory was 75.1MB in the beginning and 67.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 11:04:54,234 INFO L158 Benchmark]: RCFGBuilder took 2206.57ms. Allocated memory is still 125.8MB. Free memory was 67.8MB in the beginning and 66.9MB in the end (delta: 858.7kB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2022-07-19 11:04:54,237 INFO L158 Benchmark]: TraceAbstraction took 24956.13ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 66.2MB in the beginning and 213.5MB in the end (delta: -147.2MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. [2022-07-19 11:04:54,237 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 268.4MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:04:54,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.10ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 79.1MB in the beginning and 80.0MB in the end (delta: -929.1kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.81ms. Allocated memory is still 125.8MB. Free memory was 80.0MB in the beginning and 75.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.61ms. Allocated memory is still 125.8MB. Free memory was 75.1MB in the beginning and 67.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2206.57ms. Allocated memory is still 125.8MB. Free memory was 67.8MB in the beginning and 66.9MB in the end (delta: 858.7kB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24956.13ms. Allocated memory was 125.8MB in the beginning and 268.4MB in the end (delta: 142.6MB). Free memory was 66.2MB in the beginning and 213.5MB in the end (delta: -147.2MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 268.4MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1757]: 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 1475. 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)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] EXPR s->cert VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967291:0}, s={-4294967291:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:5}, blastFlag=1, got_new_session=0, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=1, got_new_session=1, init=1, ret=10, s={-4294967291:0}, s={-4294967291:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1388] s->init_num = 0 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967310, (s->s3)->tmp.new_cipher={-4294967292:0}, blastFlag=2, got_new_session=1, init=1, ret=14, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1401] COND FALSE !(ret <= 0) VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [={0:5}, blastFlag=6, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->options=4294967315, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [={0:5}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1442] COND FALSE !(ret <= 0) VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967321, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1167] COND TRUE 1 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->verify_mode=7, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [={0:5}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->session={-4294967294:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967310, (s->s3)->tmp.new_cipher={-4294967292:0}, blastFlag=7, got_new_session=1, init=1, l=14, ret=1, s={-4294967291:0}, s={-4294967291:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=0, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1757] reach_error() VAL [={0:5}, blastFlag=7, got_new_session=1, init=1, l=14, ret=0, s={-4294967291:0}, s={-4294967291:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=0, tmp=0, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2802 SdHoareTripleChecker+Valid, 19.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2802 mSDsluCounter, 13512 SdHoareTripleChecker+Invalid, 17.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7878 mSDsCounter, 836 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5592 IncrementalHoareTripleChecker+Invalid, 6428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 836 mSolverCounterUnsat, 5634 mSDtfsCounter, 5592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1675occurred in iteration=30, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 1354 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2660 NumberOfCodeBlocks, 2660 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2500 ConstructedInterpolants, 0 QuantifiedInterpolants, 6359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 1458/1458 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-19 11:04:54,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.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 be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:04:56,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:04:56,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:04:56,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:04:56,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:04:56,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:04:56,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:04:56,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:04:56,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:04:56,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:04:56,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:04:56,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:04:56,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:04:56,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:04:56,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:04:56,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:04:56,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:04:56,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:04:56,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:04:56,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:04:56,187 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:04:56,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:04:56,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:04:56,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:04:56,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:04:56,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:04:56,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:04:56,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:04:56,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:04:56,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:04:56,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:04:56,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:04:56,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:04:56,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:04:56,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:04:56,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:04:56,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:04:56,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:04:56,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:04:56,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:04:56,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:04:56,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:04:56,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 11:04:56,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:04:56,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:04:56,226 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:04:56,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:04:56,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:04:56,227 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:04:56,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:04:56,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:04:56,228 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:04:56,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:04:56,229 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:04:56,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:04:56,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:04:56,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:04:56,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:04:56,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:04:56,230 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 11:04:56,230 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 11:04:56,230 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 11:04:56,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:04:56,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:04:56,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:04:56,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:04:56,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:04:56,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:04:56,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:04:56,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:04:56,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:04:56,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:04:56,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:04:56,232 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 11:04:56,232 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 11:04:56,233 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:04:56,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:04:56,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:04:56,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 11:04:56,233 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 -> be72ada7daf51b9672b82550c90021fecf4891e35726a3813c73070b244ac267 [2022-07-19 11:04:56,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:04:56,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:04:56,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:04:56,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:04:56,525 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:04:56,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-19 11:04:56,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b27a193d/077e24f21a054eaf893a82f2801642c1/FLAG1a75c386a [2022-07-19 11:04:57,016 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:04:57,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2022-07-19 11:04:57,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b27a193d/077e24f21a054eaf893a82f2801642c1/FLAG1a75c386a [2022-07-19 11:04:57,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b27a193d/077e24f21a054eaf893a82f2801642c1 [2022-07-19 11:04:57,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:04:57,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:04:57,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:04:57,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:04:57,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:04:57,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d416c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57, skipping insertion in model container [2022-07-19 11:04:57,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:04:57,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:04:57,392 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.11.i.cil-1.c[74369,74382] [2022-07-19 11:04:57,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:04:57,410 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 11:04:57,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:04:57,488 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.11.i.cil-1.c[74369,74382] [2022-07-19 11:04:57,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:04:57,514 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:04:57,567 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.11.i.cil-1.c[74369,74382] [2022-07-19 11:04:57,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:04:57,585 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:04:57,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57 WrapperNode [2022-07-19 11:04:57,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:04:57,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:04:57,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:04:57,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:04:57,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,662 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 762 [2022-07-19 11:04:57,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:04:57,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:04:57,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:04:57,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:04:57,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:04:57,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:04:57,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:04:57,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:04:57,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (1/1) ... [2022-07-19 11:04:57,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:04:57,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:04:57,825 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-19 11:04:57,872 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-19 11:04:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:04:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 11:04:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:04:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 11:04:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:04:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:04:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:04:57,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:04:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 11:04:58,075 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:04:58,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:04:58,086 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:05:06,271 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 11:05:06,271 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 11:05:06,271 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:05:06,278 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:05:06,278 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:05:06,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:05:06 BoogieIcfgContainer [2022-07-19 11:05:06,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:05:06,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:05:06,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:05:06,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:05:06,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:04:57" (1/3) ... [2022-07-19 11:05:06,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5ded47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:05:06, skipping insertion in model container [2022-07-19 11:05:06,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:04:57" (2/3) ... [2022-07-19 11:05:06,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5ded47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:05:06, skipping insertion in model container [2022-07-19 11:05:06,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:05:06" (3/3) ... [2022-07-19 11:05:06,285 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2022-07-19 11:05:06,307 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:05:06,307 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:05:06,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:05:06,372 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@49063b85, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74d420fc [2022-07-19 11:05:06,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:05:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 11:05:06,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:05:06,382 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] [2022-07-19 11:05:06,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:05:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:05:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2022-07-19 11:05:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:05:06,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331301187] [2022-07-19 11:05:06,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:05:06,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:05:06,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:05:06,417 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-19 11:05:06,450 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-19 11:05:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:05:06,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:05:06,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:05:07,080 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-19 11:05:07,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:05:07,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:05:07,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331301187] [2022-07-19 11:05:07,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331301187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:05:07,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:05:07,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:05:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097299818] [2022-07-19 11:05:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:05:07,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:05:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:05:07,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:05:07,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:05:07,116 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:05:07,242 INFO L93 Difference]: Finished difference Result 427 states and 728 transitions. [2022-07-19 11:05:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:05:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-07-19 11:05:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:05:07,251 INFO L225 Difference]: With dead ends: 427 [2022-07-19 11:05:07,252 INFO L226 Difference]: Without dead ends: 261 [2022-07-19 11:05:07,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-19 11:05:07,256 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:05:07,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 461 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:05:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-19 11:05:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-07-19 11:05:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5153846153846153) internal successors, (394), 260 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2022-07-19 11:05:07,293 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 37 [2022-07-19 11:05:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:05:07,293 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2022-07-19 11:05:07,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2022-07-19 11:05:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 11:05:07,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:05:07,296 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] [2022-07-19 11:05:07,328 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-19 11:05:07,512 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-19 11:05:07,512 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:05:07,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:05:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1297584632, now seen corresponding path program 1 times [2022-07-19 11:05:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:05:07,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507379071] [2022-07-19 11:05:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:05:07,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:05:07,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:05:07,515 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-19 11:05:07,548 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-19 11:05:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:05:07,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:05:07,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:05:08,080 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-19 11:05:08,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:05:08,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:05:08,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507379071] [2022-07-19 11:05:08,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507379071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:05:08,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:05:08,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:05:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969176797] [2022-07-19 11:05:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:05:08,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:05:08,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:05:08,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:05:08,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:05:08,083 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:05:08,790 INFO L93 Difference]: Finished difference Result 510 states and 781 transitions. [2022-07-19 11:05:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:05:08,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-07-19 11:05:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:05:08,792 INFO L225 Difference]: With dead ends: 510 [2022-07-19 11:05:08,793 INFO L226 Difference]: Without dead ends: 383 [2022-07-19 11:05:08,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-19 11:05:08,794 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 11:05:08,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 11:05:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-19 11:05:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2022-07-19 11:05:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5052356020942408) internal successors, (575), 382 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 575 transitions. [2022-07-19 11:05:08,808 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 575 transitions. Word has length 54 [2022-07-19 11:05:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:05:08,808 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 575 transitions. [2022-07-19 11:05:08,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 575 transitions. [2022-07-19 11:05:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-19 11:05:08,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:05:08,811 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] [2022-07-19 11:05:08,828 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-19 11:05:09,024 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-19 11:05:09,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:05:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:05:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2072838766, now seen corresponding path program 1 times [2022-07-19 11:05:09,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:05:09,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179387437] [2022-07-19 11:05:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:05:09,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:05:09,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:05:09,027 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-19 11:05:09,045 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-19 11:05:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:05:09,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:05:09,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:05:09,633 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-19 11:05:09,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:05:09,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:05:09,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179387437] [2022-07-19 11:05:09,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179387437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:05:09,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:05:09,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:05:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604223169] [2022-07-19 11:05:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:05:09,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:05:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:05:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:05:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:05:09,635 INFO L87 Difference]: Start difference. First operand 383 states and 575 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:05:10,294 INFO L93 Difference]: Finished difference Result 754 states and 1144 transitions. [2022-07-19 11:05:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:05:10,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-07-19 11:05:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:05:10,297 INFO L225 Difference]: With dead ends: 754 [2022-07-19 11:05:10,297 INFO L226 Difference]: Without dead ends: 505 [2022-07-19 11:05:10,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-19 11:05:10,298 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:05:10,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 11:05:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-19 11:05:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2022-07-19 11:05:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.501984126984127) internal successors, (757), 504 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 757 transitions. [2022-07-19 11:05:10,347 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 757 transitions. Word has length 76 [2022-07-19 11:05:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:05:10,347 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 757 transitions. [2022-07-19 11:05:10,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 757 transitions. [2022-07-19 11:05:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 11:05:10,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:05:10,350 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-19 11:05:10,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-19 11:05:10,564 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-19 11:05:10,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:05:10,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:05:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1458485308, now seen corresponding path program 1 times [2022-07-19 11:05:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:05:10,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726432908] [2022-07-19 11:05:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:05:10,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:05:10,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:05:10,568 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-19 11:05:10,572 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-19 11:05:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:05:11,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:05:11,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:05:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 11:05:11,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:05:11,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:05:11,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726432908] [2022-07-19 11:05:11,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726432908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:05:11,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:05:11,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:05:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456056556] [2022-07-19 11:05:11,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:05:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:05:11,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:05:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:05:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:05:11,242 INFO L87 Difference]: Start difference. First operand 505 states and 757 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:05:11,591 INFO L93 Difference]: Finished difference Result 1000 states and 1510 transitions. [2022-07-19 11:05:11,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:05:11,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 100 [2022-07-19 11:05:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:05:11,594 INFO L225 Difference]: With dead ends: 1000 [2022-07-19 11:05:11,594 INFO L226 Difference]: Without dead ends: 629 [2022-07-19 11:05:11,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 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-19 11:05:11,595 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:05:11,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 572 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 11:05:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-07-19 11:05:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2022-07-19 11:05:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4984076433121019) internal successors, (941), 628 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 941 transitions. [2022-07-19 11:05:11,606 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 941 transitions. Word has length 100 [2022-07-19 11:05:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:05:11,606 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 941 transitions. [2022-07-19 11:05:11,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 941 transitions. [2022-07-19 11:05:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-19 11:05:11,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:05:11,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:05:11,626 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-19 11:05:11,816 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-19 11:05:11,817 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:05:11,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:05:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1045011737, now seen corresponding path program 1 times [2022-07-19 11:05:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:05:11,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991268776] [2022-07-19 11:05:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:05:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:05:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:05:11,820 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-19 11:05:11,821 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-19 11:05:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:05:12,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:05:12,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:05:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 11:05:12,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:05:12,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:05:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991268776] [2022-07-19 11:05:12,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991268776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:05:12,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:05:12,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:05:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773612146] [2022-07-19 11:05:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:05:12,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:05:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:05:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:05:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:05:12,465 INFO L87 Difference]: Start difference. First operand 629 states and 941 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:05:13,091 INFO L93 Difference]: Finished difference Result 1246 states and 1875 transitions. [2022-07-19 11:05:13,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:05:13,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 117 [2022-07-19 11:05:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:05:13,093 INFO L225 Difference]: With dead ends: 1246 [2022-07-19 11:05:13,093 INFO L226 Difference]: Without dead ends: 751 [2022-07-19 11:05:13,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 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-19 11:05:13,095 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 149 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:05:13,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 11:05:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-07-19 11:05:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2022-07-19 11:05:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.496) internal successors, (1122), 750 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1122 transitions. [2022-07-19 11:05:13,111 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1122 transitions. Word has length 117 [2022-07-19 11:05:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:05:13,112 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1122 transitions. [2022-07-19 11:05:13,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1122 transitions. [2022-07-19 11:05:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 11:05:13,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:05:13,114 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-19 11:05:13,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-19 11:05:13,331 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-19 11:05:13,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:05:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:05:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485834, now seen corresponding path program 1 times [2022-07-19 11:05:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:05:13,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827215363] [2022-07-19 11:05:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:05:13,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:05:13,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:05:13,334 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-19 11:05:13,338 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-19 11:05:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:05:14,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 11:05:14,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:05:14,715 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-19 11:05:14,727 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-19 11:05:15,244 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-19 11:05:15,244 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 78 treesize of output 85 [2022-07-19 11:05:15,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,303 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 78 treesize of output 85 [2022-07-19 11:05:15,456 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-19 11:05:15,456 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-19 11:05:15,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:05:15,506 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-19 11:05:15,537 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-19 11:05:15,543 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-19 11:05:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-19 11:05:15,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:05:15,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:05:15,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827215363] [2022-07-19 11:05:15,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827215363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:05:15,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:05:15,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 11:05:15,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802179461] [2022-07-19 11:05:15,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:05:15,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 11:05:15,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:05:15,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 11:05:15,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:05:15,568 INFO L87 Difference]: Start difference. First operand 751 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-19 11:05:17,589 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-19 11:05:19,597 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-19 11:05:23,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:05:28,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:05:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:05:29,917 INFO L93 Difference]: Finished difference Result 1499 states and 2240 transitions. [2022-07-19 11:05:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 11:05:29,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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 129 [2022-07-19 11:05:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:05:29,921 INFO L225 Difference]: With dead ends: 1499 [2022-07-19 11:05:29,921 INFO L226 Difference]: Without dead ends: 751 [2022-07-19 11:05:29,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 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-19 11:05:29,922 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:05:29,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 14.3s Time] [2022-07-19 11:05:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-07-19 11:05:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2022-07-19 11:05:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4946666666666666) internal successors, (1121), 750 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1121 transitions. [2022-07-19 11:05:29,934 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1121 transitions. Word has length 129 [2022-07-19 11:05:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:05:29,934 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1121 transitions. [2022-07-19 11:05:29,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-19 11:05:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1121 transitions. [2022-07-19 11:05:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 11:05:29,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:05:29,936 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-19 11:05:29,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-19 11:05:30,148 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-19 11:05:30,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:05:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:05:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1440991432, now seen corresponding path program 1 times [2022-07-19 11:05:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:05:30,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089183359] [2022-07-19 11:05:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:05:30,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:05:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:05:30,168 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-19 11:05:30,177 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-19 11:05:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:05:31,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 11:05:31,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:05:31,408 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-19 11:05:31,408 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 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-19 11:05:31,532 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-19 11:05:31,532 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 40 treesize of output 51 [2022-07-19 11:05:31,601 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 11:05:31,601 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 45 treesize of output 15 [2022-07-19 11:05:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 11:05:31,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:05:31,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:05:31,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089183359] [2022-07-19 11:05:31,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089183359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:05:31,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:05:31,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:05:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762214639] [2022-07-19 11:05:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:05:31,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:05:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:05:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:05:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:05:31,628 INFO L87 Difference]: Start difference. First operand 751 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:33,644 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-19 11:05:35,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:05:38,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:05:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:05:40,287 INFO L93 Difference]: Finished difference Result 1770 states and 2646 transitions. [2022-07-19 11:05:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:05:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-19 11:05:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:05:40,292 INFO L225 Difference]: With dead ends: 1770 [2022-07-19 11:05:40,292 INFO L226 Difference]: Without dead ends: 1029 [2022-07-19 11:05:40,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-19 11:05:40,294 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-19 11:05:40,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 590 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 1 Unknown, 40 Unchecked, 8.6s Time] [2022-07-19 11:05:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2022-07-19 11:05:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 906. [2022-07-19 11:05:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 1.529281767955801) internal successors, (1384), 905 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1384 transitions. [2022-07-19 11:05:40,311 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1384 transitions. Word has length 129 [2022-07-19 11:05:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:05:40,312 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1384 transitions. [2022-07-19 11:05:40,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:05:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1384 transitions. [2022-07-19 11:05:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 11:05:40,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:05:40,314 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-19 11:05:40,338 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-19 11:05:40,531 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-19 11:05:40,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:05:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:05:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2022-07-19 11:05:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:05:40,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947682925] [2022-07-19 11:05:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:05:40,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:05:40,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:05:40,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:05:40,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 11:05:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:05:44,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:05:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:05:47,986 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-19 11:05:47,986 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:05:47,987 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:05:48,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 11:05:48,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:05:48,192 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:05:48,195 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:05:48,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:05:48 BoogieIcfgContainer [2022-07-19 11:05:48,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:05:48,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:05:48,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:05:48,328 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:05:48,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:05:06" (3/4) ... [2022-07-19 11:05:48,330 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 11:05:48,400 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 11:05:48,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:05:48,401 INFO L158 Benchmark]: Toolchain (without parser) took 51357.64ms. Allocated memory was 52.4MB in the beginning and 94.4MB in the end (delta: 41.9MB). Free memory was 27.5MB in the beginning and 28.7MB in the end (delta: -1.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-07-19 11:05:48,401 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory was 33.6MB in the beginning and 33.6MB in the end (delta: 45.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:05:48,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.51ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.3MB in the beginning and 35.0MB in the end (delta: -7.7MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-19 11:05:48,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.46ms. Allocated memory is still 69.2MB. Free memory was 35.0MB in the beginning and 30.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 11:05:48,403 INFO L158 Benchmark]: Boogie Preprocessor took 95.75ms. Allocated memory is still 69.2MB. Free memory was 30.1MB in the beginning and 45.3MB in the end (delta: -15.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-07-19 11:05:48,403 INFO L158 Benchmark]: RCFGBuilder took 8521.19ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 45.3MB in the beginning and 65.8MB in the end (delta: -20.6MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-07-19 11:05:48,404 INFO L158 Benchmark]: TraceAbstraction took 42046.25ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 44.2MB in the end (delta: 20.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2022-07-19 11:05:48,404 INFO L158 Benchmark]: Witness Printer took 72.47ms. Allocated memory is still 94.4MB. Free memory was 44.2MB in the beginning and 28.7MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 11:05:48,407 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory was 33.6MB in the beginning and 33.6MB in the end (delta: 45.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.51ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.3MB in the beginning and 35.0MB in the end (delta: -7.7MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.46ms. Allocated memory is still 69.2MB. Free memory was 35.0MB in the beginning and 30.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.75ms. Allocated memory is still 69.2MB. Free memory was 30.1MB in the beginning and 45.3MB in the end (delta: -15.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * RCFGBuilder took 8521.19ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 45.3MB in the beginning and 65.8MB in the end (delta: -20.6MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42046.25ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 44.2MB in the end (delta: 20.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * Witness Printer took 72.47ms. Allocated memory is still 94.4MB. Free memory was 44.2MB in the beginning and 28.7MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1757]: 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)) [L1087] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1088] s->options = __VERIFIER_nondet_ulong() [L1089] s->verify_mode = __VERIFIER_nondet_int() [L1090] EXPR s->session [L1090] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1091] EXPR s->s3 [L1091] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1093] EXPR s->s3 [L1093] EXPR (s->s3)->tmp.new_cipher [L1093] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1095] COND FALSE !(__VERIFIER_nondet_int()) [L1101] s->cert = malloc(sizeof(struct cert_st)) [L1102] EXPR s->cert [L1102] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1105] CALL ssl3_accept(s) [L1111] BUF_MEM *buf ; [L1112] unsigned long l ; [L1113] unsigned long Time ; [L1114] unsigned long tmp ; [L1115] void (*cb)() ; [L1116] long num1 ; [L1117] int ret ; [L1118] int new_state ; [L1119] int state ; [L1120] int skip ; [L1121] int got_new_session ; [L1122] int tmp___1 = __VERIFIER_nondet_int() ; [L1123] int tmp___2 = __VERIFIER_nondet_int() ; [L1124] int tmp___3 = __VERIFIER_nondet_int() ; [L1125] int tmp___4 = __VERIFIER_nondet_int() ; [L1126] int tmp___5 = __VERIFIER_nondet_int() ; [L1127] int tmp___6 = __VERIFIER_nondet_int() ; [L1128] int tmp___7 ; [L1129] long tmp___8 = __VERIFIER_nondet_long() ; [L1130] int tmp___9 = __VERIFIER_nondet_int() ; [L1131] int tmp___10 = __VERIFIER_nondet_int() ; [L1132] int blastFlag ; [L1136] s->state = 8464 [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->cert={6:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=0, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->hit=0, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1383] COND FALSE !(s->hit) [L1386] s->state = 8512 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1388] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8512, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1209] COND TRUE s->state == 8512 [L1392] EXPR s->s3 [L1392] EXPR (s->s3)->tmp.new_cipher [L1392] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={1073741837:0}, blastFlag=2, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1392] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1395] ret = __VERIFIER_nondet_int() [L1396] COND TRUE blastFlag == 2 [L1397] blastFlag = 6 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1401] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1407] s->state = 8528 [L1408] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8512, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8528, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1215] COND TRUE s->state == 8528 [L1412] EXPR s->s3 [L1412] EXPR (s->s3)->tmp.new_cipher [L1412] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1412] l = ((s->s3)->tmp.new_cipher)->algorithms [L1413] EXPR s->options VAL [={0:-2147483648}, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->options=2097152, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1413] COND TRUE s->options & 2097152UL [L1414] EXPR s->s3 [L1414] (s->s3)->tmp.use_rsa_tmp = 1 [L1418] EXPR s->s3 [L1418] (s->s3)->tmp.use_rsa_tmp VAL [={0:-2147483648}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1418] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1436] ret = __VERIFIER_nondet_int() [L1437] COND TRUE blastFlag == 6 [L1438] blastFlag = 7 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1442] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1459] s->state = 8544 [L1460] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1716] EXPR s->s3 [L1716] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1716] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1745] skip = 0 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1167] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8528, Time=5, tmp=5, tmp___1=0] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->state=8544, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1221] COND TRUE s->state == 8544 [L1464] EXPR s->verify_mode VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->verify_mode=1, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1464] COND TRUE s->verify_mode & 1 [L1465] EXPR s->session [L1465] EXPR (s->session)->peer VAL [={0:-2147483648}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->session={12:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1465] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1475] EXPR s->s3 [L1475] EXPR (s->s3)->tmp.new_cipher [L1475] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={1073741837:0}, blastFlag=7, got_new_session=1, init=1, l=0, ret=1073741824, s={7:0}, s={7:0}, s->s3={13:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1475] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1485] EXPR s->s3 [L1485] (s->s3)->tmp.cert_request = 1 [L1486] ret = __VERIFIER_nondet_int() [L1487] COND TRUE blastFlag == 7 VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=8, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] [L1757] reach_error() VAL [={0:-2147483648}, blastFlag=7, got_new_session=1, init=1, l=0, ret=8, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8544, Time=5, tmp=5, tmp___1=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.8s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 25.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 3999 SdHoareTripleChecker+Invalid, 24.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 2210 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=906occurred in iteration=7, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 123 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.0s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 635 ConstructedInterpolants, 1 QuantifiedInterpolants, 1250 SizeOfPredicates, 11 NumberOfNonLiveVariables, 5501 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 534/534 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-19 11:05:48,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE