./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/s3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/s3.i -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 d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 15:08:50,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 15:08:50,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 15:08:50,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 15:08:50,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 15:08:50,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 15:08:50,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 15:08:50,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 15:08:50,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 15:08:50,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 15:08:50,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 15:08:50,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 15:08:50,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 15:08:50,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 15:08:50,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 15:08:50,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 15:08:50,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 15:08:50,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 15:08:50,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 15:08:50,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 15:08:50,281 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 15:08:50,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 15:08:50,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 15:08:50,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 15:08:50,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 15:08:50,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 15:08:50,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 15:08:50,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 15:08:50,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 15:08:50,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 15:08:50,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 15:08:50,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 15:08:50,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 15:08:50,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 15:08:50,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 15:08:50,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 15:08:50,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 15:08:50,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 15:08:50,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 15:08:50,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 15:08:50,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 15:08:50,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 15:08:50,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 15:08:50,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 15:08:50,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 15:08:50,323 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 15:08:50,323 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 15:08:50,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 15:08:50,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 15:08:50,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 15:08:50,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 15:08:50,325 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 15:08:50,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 15:08:50,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 15:08:50,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 15:08:50,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 15:08:50,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 15:08:50,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 15:08:50,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 15:08:50,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 15:08:50,327 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 15:08:50,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 15:08:50,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 15:08:50,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 15:08:50,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 15:08:50,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 15:08:50,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 15:08:50,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:08:50,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 15:08:50,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 15:08:50,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 15:08:50,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 15:08:50,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 15:08:50,329 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 15:08:50,329 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 15:08:50,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 15:08:50,329 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 -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2022-07-22 15:08:50,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 15:08:50,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 15:08:50,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 15:08:50,534 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 15:08:50,534 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 15:08:50,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-22 15:08:50,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be549a99d/6d834869d47849acb085de19e1612ada/FLAG1b438dfcd [2022-07-22 15:08:50,985 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 15:08:50,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-22 15:08:51,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be549a99d/6d834869d47849acb085de19e1612ada/FLAG1b438dfcd [2022-07-22 15:08:51,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be549a99d/6d834869d47849acb085de19e1612ada [2022-07-22 15:08:51,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 15:08:51,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 15:08:51,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 15:08:51,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 15:08:51,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 15:08:51,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fafeda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51, skipping insertion in model container [2022-07-22 15:08:51,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 15:08:51,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 15:08:51,640 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/loops/s3.i[64167,64180] [2022-07-22 15:08:51,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:08:51,655 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 15:08:51,728 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/loops/s3.i[64167,64180] [2022-07-22 15:08:51,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:08:51,741 INFO L208 MainTranslator]: Completed translation [2022-07-22 15:08:51,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51 WrapperNode [2022-07-22 15:08:51,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 15:08:51,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 15:08:51,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 15:08:51,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 15:08:51,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,806 INFO L137 Inliner]: procedures = 30, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 732 [2022-07-22 15:08:51,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 15:08:51,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 15:08:51,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 15:08:51,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 15:08:51,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 15:08:51,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 15:08:51,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 15:08:51,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 15:08:51,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (1/1) ... [2022-07-22 15:08:51,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:08:51,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:08:51,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 15:08:51,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 15:08:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 15:08:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 15:08:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 15:08:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 15:08:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 15:08:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 15:08:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 15:08:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 15:08:51,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 15:08:52,131 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 15:08:52,133 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 15:08:52,143 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 15:08:54,798 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-22 15:08:54,799 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-22 15:08:54,799 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 15:08:54,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 15:08:54,808 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 15:08:54,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:08:54 BoogieIcfgContainer [2022-07-22 15:08:54,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 15:08:54,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 15:08:54,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 15:08:54,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 15:08:54,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 03:08:51" (1/3) ... [2022-07-22 15:08:54,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38473a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:08:54, skipping insertion in model container [2022-07-22 15:08:54,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:08:51" (2/3) ... [2022-07-22 15:08:54,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38473a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:08:54, skipping insertion in model container [2022-07-22 15:08:54,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:08:54" (3/3) ... [2022-07-22 15:08:54,820 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-22 15:08:54,829 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 15:08:54,829 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 15:08:54,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 15:08:54,866 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@747e9ba, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@655779a2 [2022-07-22 15:08:54,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 15:08:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:08:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 15:08:54,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:08:54,875 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] [2022-07-22 15:08:54,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:08:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:08:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-22 15:08:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:08:54,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823177189] [2022-07-22 15:08:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:08:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:08:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:08:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:08:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:08:55,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823177189] [2022-07-22 15:08:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823177189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:08:55,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:08:55,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:08:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667710071] [2022-07-22 15:08:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:08:55,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:08:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:08:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:08:55,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:08:55,346 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:08:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:08:55,404 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-22 15:08:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:08:55,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-22 15:08:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:08:55,413 INFO L225 Difference]: With dead ends: 375 [2022-07-22 15:08:55,413 INFO L226 Difference]: Without dead ends: 217 [2022-07-22 15:08:55,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:08:55,417 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:08:55,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:08:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-22 15:08:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-22 15:08:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:08:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-22 15:08:55,451 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-22 15:08:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:08:55,452 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-22 15:08:55,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:08:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-22 15:08:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 15:08:55,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:08:55,454 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] [2022-07-22 15:08:55,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 15:08:55,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:08:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:08:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-22 15:08:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:08:55,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145310419] [2022-07-22 15:08:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:08:55,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:08:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:08:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:08:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:08:55,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145310419] [2022-07-22 15:08:55,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145310419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:08:55,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:08:55,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:08:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457989966] [2022-07-22 15:08:55,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:08:55,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:08:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:08:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:08:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:08:55,601 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:08:57,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:08:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:08:57,918 INFO L93 Difference]: Finished difference Result 612 states and 909 transitions. [2022-07-22 15:08:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:08:57,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-07-22 15:08:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:08:57,921 INFO L225 Difference]: With dead ends: 612 [2022-07-22 15:08:57,921 INFO L226 Difference]: Without dead ends: 402 [2022-07-22 15:08:57,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:08:57,922 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:08:57,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 271 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 15:08:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-22 15:08:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 265. [2022-07-22 15:08:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:08:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2022-07-22 15:08:57,944 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 39 [2022-07-22 15:08:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:08:57,944 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2022-07-22 15:08:57,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:08:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2022-07-22 15:08:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 15:08:57,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:08:57,946 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] [2022-07-22 15:08:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 15:08:57,946 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:08:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:08:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash -228723188, now seen corresponding path program 1 times [2022-07-22 15:08:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:08:57,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276133759] [2022-07-22 15:08:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:08:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:08:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:08:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:08:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:08:58,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276133759] [2022-07-22 15:08:58,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276133759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:08:58,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:08:58,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:08:58,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776939745] [2022-07-22 15:08:58,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:08:58,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:08:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:08:58,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:08:58,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:08:58,095 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:00,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:02,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:02,295 INFO L93 Difference]: Finished difference Result 431 states and 660 transitions. [2022-07-22 15:09:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:02,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-07-22 15:09:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:02,303 INFO L225 Difference]: With dead ends: 431 [2022-07-22 15:09:02,303 INFO L226 Difference]: Without dead ends: 300 [2022-07-22 15:09:02,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:02,304 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:02,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 476 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 15:09:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-22 15:09:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 283. [2022-07-22 15:09:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5425531914893618) internal successors, (435), 282 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2022-07-22 15:09:02,314 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 40 [2022-07-22 15:09:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:02,314 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2022-07-22 15:09:02,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2022-07-22 15:09:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 15:09:02,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:02,316 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 15:09:02,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 15:09:02,316 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:02,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1727416149, now seen corresponding path program 1 times [2022-07-22 15:09:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:02,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831302525] [2022-07-22 15:09:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:09:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:02,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831302525] [2022-07-22 15:09:02,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831302525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:02,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:02,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:02,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346732726] [2022-07-22 15:09:02,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:02,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:02,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:02,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:02,457 INFO L87 Difference]: Start difference. First operand 283 states and 435 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:04,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:06,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:06,727 INFO L93 Difference]: Finished difference Result 758 states and 1164 transitions. [2022-07-22 15:09:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:06,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-07-22 15:09:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:06,729 INFO L225 Difference]: With dead ends: 758 [2022-07-22 15:09:06,729 INFO L226 Difference]: Without dead ends: 482 [2022-07-22 15:09:06,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:06,730 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 113 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:06,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 501 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 15:09:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-22 15:09:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 308. [2022-07-22 15:09:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.52442996742671) internal successors, (468), 307 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 468 transitions. [2022-07-22 15:09:06,745 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 468 transitions. Word has length 55 [2022-07-22 15:09:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:06,746 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 468 transitions. [2022-07-22 15:09:06,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 468 transitions. [2022-07-22 15:09:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 15:09:06,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:06,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:06,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 15:09:06,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1149096951, now seen corresponding path program 1 times [2022-07-22 15:09:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:06,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764631137] [2022-07-22 15:09:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:09:06,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:06,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764631137] [2022-07-22 15:09:06,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764631137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:06,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:06,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469562603] [2022-07-22 15:09:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:06,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:06,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:06,896 INFO L87 Difference]: Start difference. First operand 308 states and 468 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:08,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:10,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:11,090 INFO L93 Difference]: Finished difference Result 484 states and 735 transitions. [2022-07-22 15:09:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:11,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-07-22 15:09:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:11,091 INFO L225 Difference]: With dead ends: 484 [2022-07-22 15:09:11,091 INFO L226 Difference]: Without dead ends: 324 [2022-07-22 15:09:11,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:11,092 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:11,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 474 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 15:09:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-22 15:09:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2022-07-22 15:09:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.521172638436482) internal successors, (467), 307 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2022-07-22 15:09:11,099 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 55 [2022-07-22 15:09:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:11,100 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2022-07-22 15:09:11,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2022-07-22 15:09:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-22 15:09:11,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:11,101 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 15:09:11,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 15:09:11,101 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1382837768, now seen corresponding path program 1 times [2022-07-22 15:09:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:11,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909709300] [2022-07-22 15:09:11,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:09:11,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:11,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909709300] [2022-07-22 15:09:11,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909709300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:11,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:11,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:11,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750384867] [2022-07-22 15:09:11,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:11,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:11,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:11,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:11,208 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:13,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:13,449 INFO L93 Difference]: Finished difference Result 768 states and 1162 transitions. [2022-07-22 15:09:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:13,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-07-22 15:09:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:13,451 INFO L225 Difference]: With dead ends: 768 [2022-07-22 15:09:13,451 INFO L226 Difference]: Without dead ends: 470 [2022-07-22 15:09:13,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:13,452 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 119 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:13,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 292 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 15:09:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-22 15:09:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 312. [2022-07-22 15:09:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5112540192926045) internal successors, (470), 311 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 470 transitions. [2022-07-22 15:09:13,461 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 470 transitions. Word has length 56 [2022-07-22 15:09:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:13,461 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 470 transitions. [2022-07-22 15:09:13,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 470 transitions. [2022-07-22 15:09:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 15:09:13,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:13,463 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 15:09:13,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 15:09:13,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 270979954, now seen corresponding path program 1 times [2022-07-22 15:09:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:13,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597956124] [2022-07-22 15:09:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:09:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:13,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597956124] [2022-07-22 15:09:13,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597956124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:13,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:13,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:13,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068702154] [2022-07-22 15:09:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:13,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:13,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:13,545 INFO L87 Difference]: Start difference. First operand 312 states and 470 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-22 15:09:15,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:17,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:17,825 INFO L93 Difference]: Finished difference Result 490 states and 737 transitions. [2022-07-22 15:09:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:17,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-22 15:09:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:17,827 INFO L225 Difference]: With dead ends: 490 [2022-07-22 15:09:17,827 INFO L226 Difference]: Without dead ends: 328 [2022-07-22 15:09:17,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:17,829 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 31 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:17,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 470 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 15:09:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-22 15:09:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 312. [2022-07-22 15:09:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5080385852090032) internal successors, (469), 311 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 469 transitions. [2022-07-22 15:09:17,838 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 469 transitions. Word has length 57 [2022-07-22 15:09:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:17,839 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 469 transitions. [2022-07-22 15:09:17,839 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-22 15:09:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 469 transitions. [2022-07-22 15:09:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 15:09:17,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:17,841 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 15:09:17,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 15:09:17,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1460862829, now seen corresponding path program 1 times [2022-07-22 15:09:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:17,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787583517] [2022-07-22 15:09:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:09:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:17,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787583517] [2022-07-22 15:09:17,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787583517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:17,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:17,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494954386] [2022-07-22 15:09:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:17,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:17,929 INFO L87 Difference]: Start difference. First operand 312 states and 469 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-22 15:09:19,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:20,175 INFO L93 Difference]: Finished difference Result 772 states and 1158 transitions. [2022-07-22 15:09:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:20,184 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-22 15:09:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:20,185 INFO L225 Difference]: With dead ends: 772 [2022-07-22 15:09:20,185 INFO L226 Difference]: Without dead ends: 470 [2022-07-22 15:09:20,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:20,186 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:20,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 15:09:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-22 15:09:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 316. [2022-07-22 15:09:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.4984126984126984) internal successors, (472), 315 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2022-07-22 15:09:20,196 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 58 [2022-07-22 15:09:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:20,196 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2022-07-22 15:09:20,197 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-22 15:09:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2022-07-22 15:09:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 15:09:20,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:20,198 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-22 15:09:20,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 15:09:20,198 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:20,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1518169684, now seen corresponding path program 1 times [2022-07-22 15:09:20,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:20,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483495491] [2022-07-22 15:09:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:20,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 15:09:20,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:20,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483495491] [2022-07-22 15:09:20,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483495491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:20,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:20,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:09:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968414889] [2022-07-22 15:09:20,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:20,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:09:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:20,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:09:20,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:09:20,312 INFO L87 Difference]: Start difference. First operand 316 states and 472 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:22,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:22,351 INFO L93 Difference]: Finished difference Result 641 states and 962 transitions. [2022-07-22 15:09:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:09:22,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-22 15:09:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:22,353 INFO L225 Difference]: With dead ends: 641 [2022-07-22 15:09:22,353 INFO L226 Difference]: Without dead ends: 477 [2022-07-22 15:09:22,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:09:22,353 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:22,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 15:09:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-22 15:09:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2022-07-22 15:09:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4915966386554622) internal successors, (710), 476 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 710 transitions. [2022-07-22 15:09:22,364 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 710 transitions. Word has length 58 [2022-07-22 15:09:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:22,365 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 710 transitions. [2022-07-22 15:09:22,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 710 transitions. [2022-07-22 15:09:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 15:09:22,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:22,366 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-22 15:09:22,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 15:09:22,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash -853569578, now seen corresponding path program 1 times [2022-07-22 15:09:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:22,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272444408] [2022-07-22 15:09:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:09:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:22,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272444408] [2022-07-22 15:09:22,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272444408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:22,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:22,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:09:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873035362] [2022-07-22 15:09:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:22,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:09:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:22,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:09:22,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:09:22,463 INFO L87 Difference]: Start difference. First operand 477 states and 710 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-22 15:09:24,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:24,510 INFO L93 Difference]: Finished difference Result 826 states and 1228 transitions. [2022-07-22 15:09:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:09:24,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-22 15:09:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:24,512 INFO L225 Difference]: With dead ends: 826 [2022-07-22 15:09:24,513 INFO L226 Difference]: Without dead ends: 501 [2022-07-22 15:09:24,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:09:24,514 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:24,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 354 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 15:09:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-07-22 15:09:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-07-22 15:09:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.484) internal successors, (742), 500 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 742 transitions. [2022-07-22 15:09:24,523 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 742 transitions. Word has length 58 [2022-07-22 15:09:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:24,523 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 742 transitions. [2022-07-22 15:09:24,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-22 15:09:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 742 transitions. [2022-07-22 15:09:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 15:09:24,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:24,524 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 15:09:24,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 15:09:24,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:24,525 INFO L85 PathProgramCache]: Analyzing trace with hash -533479020, now seen corresponding path program 1 times [2022-07-22 15:09:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:24,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179895304] [2022-07-22 15:09:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:24,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 15:09:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:24,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179895304] [2022-07-22 15:09:24,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179895304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:24,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:24,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158049587] [2022-07-22 15:09:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:24,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:24,634 INFO L87 Difference]: Start difference. First operand 501 states and 742 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:26,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:26,903 INFO L93 Difference]: Finished difference Result 1297 states and 1926 transitions. [2022-07-22 15:09:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-22 15:09:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:26,906 INFO L225 Difference]: With dead ends: 1297 [2022-07-22 15:09:26,906 INFO L226 Difference]: Without dead ends: 806 [2022-07-22 15:09:26,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:26,907 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:26,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 15:09:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-07-22 15:09:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 579. [2022-07-22 15:09:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4965397923875432) internal successors, (865), 578 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 865 transitions. [2022-07-22 15:09:26,920 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 865 transitions. Word has length 78 [2022-07-22 15:09:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:26,920 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 865 transitions. [2022-07-22 15:09:26,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 865 transitions. [2022-07-22 15:09:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 15:09:26,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:26,921 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 15:09:26,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 15:09:26,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash 360007318, now seen corresponding path program 1 times [2022-07-22 15:09:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:26,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449453758] [2022-07-22 15:09:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:26,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 15:09:27,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:27,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449453758] [2022-07-22 15:09:27,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449453758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:27,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:27,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:27,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991022043] [2022-07-22 15:09:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:27,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:27,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:27,047 INFO L87 Difference]: Start difference. First operand 579 states and 865 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-22 15:09:29,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:29,286 INFO L93 Difference]: Finished difference Result 1363 states and 2022 transitions. [2022-07-22 15:09:29,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:29,287 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 78 [2022-07-22 15:09:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:29,290 INFO L225 Difference]: With dead ends: 1363 [2022-07-22 15:09:29,290 INFO L226 Difference]: Without dead ends: 794 [2022-07-22 15:09:29,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:29,291 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 106 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:29,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 15:09:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-22 15:09:29,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 594. [2022-07-22 15:09:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.5042158516020236) internal successors, (892), 593 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 892 transitions. [2022-07-22 15:09:29,302 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 892 transitions. Word has length 78 [2022-07-22 15:09:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:29,302 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 892 transitions. [2022-07-22 15:09:29,302 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-22 15:09:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 892 transitions. [2022-07-22 15:09:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-22 15:09:29,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:29,304 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 15:09:29,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 15:09:29,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1728932100, now seen corresponding path program 1 times [2022-07-22 15:09:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:29,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632899378] [2022-07-22 15:09:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 15:09:29,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:29,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632899378] [2022-07-22 15:09:29,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632899378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:29,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:29,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262833386] [2022-07-22 15:09:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:29,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:29,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:29,416 INFO L87 Difference]: Start difference. First operand 594 states and 892 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-22 15:09:31,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:31,680 INFO L93 Difference]: Finished difference Result 1453 states and 2163 transitions. [2022-07-22 15:09:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:31,680 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 79 [2022-07-22 15:09:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:31,683 INFO L225 Difference]: With dead ends: 1453 [2022-07-22 15:09:31,683 INFO L226 Difference]: Without dead ends: 869 [2022-07-22 15:09:31,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:31,684 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 104 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:31,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 15:09:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-22 15:09:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 672. [2022-07-22 15:09:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.5081967213114753) internal successors, (1012), 671 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1012 transitions. [2022-07-22 15:09:31,700 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1012 transitions. Word has length 79 [2022-07-22 15:09:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:31,700 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1012 transitions. [2022-07-22 15:09:31,700 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-22 15:09:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1012 transitions. [2022-07-22 15:09:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-22 15:09:31,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:31,701 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 15:09:31,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 15:09:31,702 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2061764687, now seen corresponding path program 1 times [2022-07-22 15:09:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:31,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754629891] [2022-07-22 15:09:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:31,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 15:09:31,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:31,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754629891] [2022-07-22 15:09:31,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754629891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:31,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:31,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827220218] [2022-07-22 15:09:31,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:31,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:31,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:31,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:31,813 INFO L87 Difference]: Start difference. First operand 672 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:33,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:35,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:36,047 INFO L93 Difference]: Finished difference Result 1471 states and 2201 transitions. [2022-07-22 15:09:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:36,048 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 80 [2022-07-22 15:09:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:36,050 INFO L225 Difference]: With dead ends: 1471 [2022-07-22 15:09:36,050 INFO L226 Difference]: Without dead ends: 809 [2022-07-22 15:09:36,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:36,051 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 39 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:36,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 496 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 15:09:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-22 15:09:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-22 15:09:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.5115332428765265) internal successors, (1114), 737 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2022-07-22 15:09:36,064 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 80 [2022-07-22 15:09:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:36,065 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2022-07-22 15:09:36,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2022-07-22 15:09:36,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-22 15:09:36,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:36,066 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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] [2022-07-22 15:09:36,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 15:09:36,066 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:36,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash 793593224, now seen corresponding path program 1 times [2022-07-22 15:09:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:36,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077624840] [2022-07-22 15:09:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 15:09:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:36,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077624840] [2022-07-22 15:09:36,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077624840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:36,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:36,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607010032] [2022-07-22 15:09:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:36,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:36,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:36,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:36,154 INFO L87 Difference]: Start difference. First operand 738 states and 1114 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-22 15:09:38,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:40,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:40,350 INFO L93 Difference]: Finished difference Result 1537 states and 2300 transitions. [2022-07-22 15:09:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:40,351 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 95 [2022-07-22 15:09:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:40,353 INFO L225 Difference]: With dead ends: 1537 [2022-07-22 15:09:40,353 INFO L226 Difference]: Without dead ends: 809 [2022-07-22 15:09:40,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:40,357 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 48 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:40,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 496 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 15:09:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-22 15:09:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 738. [2022-07-22 15:09:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.507462686567164) internal successors, (1111), 737 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1111 transitions. [2022-07-22 15:09:40,370 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1111 transitions. Word has length 95 [2022-07-22 15:09:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:40,370 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1111 transitions. [2022-07-22 15:09:40,370 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-22 15:09:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1111 transitions. [2022-07-22 15:09:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-22 15:09:40,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:40,371 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2022-07-22 15:09:40,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 15:09:40,372 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:40,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:40,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1231158467, now seen corresponding path program 1 times [2022-07-22 15:09:40,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:40,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717389584] [2022-07-22 15:09:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:40,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 15:09:40,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:40,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717389584] [2022-07-22 15:09:40,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717389584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:40,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:40,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115812218] [2022-07-22 15:09:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:40,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:40,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:40,493 INFO L87 Difference]: Start difference. First operand 738 states and 1111 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-22 15:09:42,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:42,769 INFO L93 Difference]: Finished difference Result 1666 states and 2484 transitions. [2022-07-22 15:09:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:42,770 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 97 [2022-07-22 15:09:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:42,772 INFO L225 Difference]: With dead ends: 1666 [2022-07-22 15:09:42,772 INFO L226 Difference]: Without dead ends: 938 [2022-07-22 15:09:42,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:42,773 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:42,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 272 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 15:09:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-22 15:09:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 738. [2022-07-22 15:09:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.4871099050203527) internal successors, (1096), 737 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1096 transitions. [2022-07-22 15:09:42,789 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1096 transitions. Word has length 97 [2022-07-22 15:09:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:42,789 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1096 transitions. [2022-07-22 15:09:42,789 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-22 15:09:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1096 transitions. [2022-07-22 15:09:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 15:09:42,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:42,790 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:09:42,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 15:09:42,791 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1142724731, now seen corresponding path program 1 times [2022-07-22 15:09:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:42,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169603711] [2022-07-22 15:09:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 15:09:42,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:42,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169603711] [2022-07-22 15:09:42,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169603711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:42,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:42,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:42,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360198796] [2022-07-22 15:09:42,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:42,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:42,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:42,921 INFO L87 Difference]: Start difference. First operand 738 states and 1096 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:44,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:46,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:47,109 INFO L93 Difference]: Finished difference Result 1510 states and 2231 transitions. [2022-07-22 15:09:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-22 15:09:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:47,111 INFO L225 Difference]: With dead ends: 1510 [2022-07-22 15:09:47,111 INFO L226 Difference]: Without dead ends: 782 [2022-07-22 15:09:47,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:47,112 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:47,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 15:09:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-07-22 15:09:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 738. [2022-07-22 15:09:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.4830393487109905) internal successors, (1093), 737 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1093 transitions. [2022-07-22 15:09:47,127 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1093 transitions. Word has length 98 [2022-07-22 15:09:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:47,128 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1093 transitions. [2022-07-22 15:09:47,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1093 transitions. [2022-07-22 15:09:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 15:09:47,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:47,129 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-22 15:09:47,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 15:09:47,129 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2022-07-22 15:09:47,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:47,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937595129] [2022-07-22 15:09:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:47,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:09:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:47,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937595129] [2022-07-22 15:09:47,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937595129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:47,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:47,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:09:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324358727] [2022-07-22 15:09:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:47,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:09:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:47,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:09:47,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:09:47,216 INFO L87 Difference]: Start difference. First operand 738 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:49,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:49,267 INFO L93 Difference]: Finished difference Result 1485 states and 2202 transitions. [2022-07-22 15:09:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:09:49,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 98 [2022-07-22 15:09:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:49,271 INFO L225 Difference]: With dead ends: 1485 [2022-07-22 15:09:49,271 INFO L226 Difference]: Without dead ends: 978 [2022-07-22 15:09:49,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:09:49,273 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:49,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 15:09:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-07-22 15:09:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2022-07-22 15:09:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.4820512820512821) internal successors, (1445), 975 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1445 transitions. [2022-07-22 15:09:49,296 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1445 transitions. Word has length 98 [2022-07-22 15:09:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:49,296 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1445 transitions. [2022-07-22 15:09:49,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1445 transitions. [2022-07-22 15:09:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 15:09:49,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:49,298 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-22 15:09:49,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 15:09:49,298 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2022-07-22 15:09:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:49,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125115810] [2022-07-22 15:09:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 15:09:49,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:49,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125115810] [2022-07-22 15:09:49,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125115810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:49,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:49,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:09:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219704287] [2022-07-22 15:09:49,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:49,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:09:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:09:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:09:49,378 INFO L87 Difference]: Start difference. First operand 976 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:51,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:51,433 INFO L93 Difference]: Finished difference Result 1695 states and 2507 transitions. [2022-07-22 15:09:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:09:51,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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-22 15:09:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:51,436 INFO L225 Difference]: With dead ends: 1695 [2022-07-22 15:09:51,436 INFO L226 Difference]: Without dead ends: 950 [2022-07-22 15:09:51,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:09:51,437 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:51,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 472 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 15:09:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-22 15:09:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2022-07-22 15:09:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 1.4741833508956796) internal successors, (1399), 949 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1399 transitions. [2022-07-22 15:09:51,453 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1399 transitions. Word has length 98 [2022-07-22 15:09:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:51,453 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1399 transitions. [2022-07-22 15:09:51,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:51,453 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1399 transitions. [2022-07-22 15:09:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 15:09:51,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:51,455 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-22 15:09:51,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 15:09:51,455 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -741144714, now seen corresponding path program 1 times [2022-07-22 15:09:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:51,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095353919] [2022-07-22 15:09:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:09:51,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:51,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095353919] [2022-07-22 15:09:51,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095353919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:51,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:51,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205511868] [2022-07-22 15:09:51,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:51,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:51,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:51,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:51,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:51,560 INFO L87 Difference]: Start difference. First operand 950 states and 1399 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:53,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:53,801 INFO L93 Difference]: Finished difference Result 2150 states and 3137 transitions. [2022-07-22 15:09:53,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:53,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-22 15:09:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:53,805 INFO L225 Difference]: With dead ends: 2150 [2022-07-22 15:09:53,805 INFO L226 Difference]: Without dead ends: 1210 [2022-07-22 15:09:53,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:53,806 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:53,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 278 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 15:09:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-07-22 15:09:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 958. [2022-07-22 15:09:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.4743991640543366) internal successors, (1411), 957 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1411 transitions. [2022-07-22 15:09:53,823 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1411 transitions. Word has length 101 [2022-07-22 15:09:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:53,824 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1411 transitions. [2022-07-22 15:09:53,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1411 transitions. [2022-07-22 15:09:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 15:09:53,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:53,826 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2022-07-22 15:09:53,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 15:09:53,826 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-22 15:09:53,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:53,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674013836] [2022-07-22 15:09:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:09:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-07-22 15:09:54,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:09:54,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674013836] [2022-07-22 15:09:54,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674013836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:09:54,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:09:54,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:09:54,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453548154] [2022-07-22 15:09:54,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:09:54,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:09:54,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:09:54,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:09:54,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:09:54,051 INFO L87 Difference]: Start difference. First operand 958 states and 1411 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-22 15:09:56,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:09:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:09:56,187 INFO L93 Difference]: Finished difference Result 1907 states and 2808 transitions. [2022-07-22 15:09:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:09:56,187 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 122 [2022-07-22 15:09:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:09:56,190 INFO L225 Difference]: With dead ends: 1907 [2022-07-22 15:09:56,190 INFO L226 Difference]: Without dead ends: 959 [2022-07-22 15:09:56,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:09:56,191 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 7 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:09:56,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 15:09:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-07-22 15:09:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 958. [2022-07-22 15:09:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.4733542319749215) internal successors, (1410), 957 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:09:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1410 transitions. [2022-07-22 15:09:56,217 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1410 transitions. Word has length 122 [2022-07-22 15:09:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:09:56,218 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1410 transitions. [2022-07-22 15:09:56,218 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-22 15:09:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1410 transitions. [2022-07-22 15:09:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 15:09:56,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:09:56,220 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1] [2022-07-22 15:09:56,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 15:09:56,220 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:09:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:09:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-22 15:09:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:09:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525682607] [2022-07-22 15:09:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:09:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:09:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 15:09:56,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 15:09:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 15:09:56,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 15:09:56,907 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 15:09:56,908 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 15:09:56,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 15:09:56,913 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] [2022-07-22 15:09:56,916 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 15:09:57,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 03:09:57 BoogieIcfgContainer [2022-07-22 15:09:57,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 15:09:57,020 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 15:09:57,020 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 15:09:57,020 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 15:09:57,020 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:08:54" (3/4) ... [2022-07-22 15:09:57,022 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 15:09:57,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 15:09:57,023 INFO L158 Benchmark]: Toolchain (without parser) took 65697.08ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 53.2MB in the beginning and 74.6MB in the end (delta: -21.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2022-07-22 15:09:57,023 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 60.8MB in the beginning and 60.7MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 15:09:57,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.14ms. Allocated memory is still 90.2MB. Free memory was 53.0MB in the beginning and 46.6MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 15:09:57,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.73ms. Allocated memory is still 90.2MB. Free memory was 46.6MB in the beginning and 41.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 15:09:57,023 INFO L158 Benchmark]: Boogie Preprocessor took 89.50ms. Allocated memory is still 90.2MB. Free memory was 41.6MB in the beginning and 34.9MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 15:09:57,024 INFO L158 Benchmark]: RCFGBuilder took 2912.27ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 34.9MB in the beginning and 52.2MB in the end (delta: -17.3MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2022-07-22 15:09:57,024 INFO L158 Benchmark]: TraceAbstraction took 62207.47ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 51.7MB in the beginning and 74.6MB in the end (delta: -22.9MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2022-07-22 15:09:57,024 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 159.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 15:09:57,025 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.19ms. Allocated memory is still 90.2MB. Free memory was 60.8MB in the beginning and 60.7MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.14ms. Allocated memory is still 90.2MB. Free memory was 53.0MB in the beginning and 46.6MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.73ms. Allocated memory is still 90.2MB. Free memory was 46.6MB in the beginning and 41.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.50ms. Allocated memory is still 90.2MB. Free memory was 41.6MB in the beginning and 34.9MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2912.27ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 34.9MB in the beginning and 52.2MB in the end (delta: -17.3MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 62207.47ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 51.7MB in the beginning and 74.6MB in the end (delta: -22.9MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 159.4MB. Free memory is still 74.6MB. 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: 1658]: 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 1343. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1262] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->init_buf={0:15}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-6}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->bbio={0:14}, s->wbio={0:-9}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-6}, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967315, (s->s3)->tmp.new_cipher={-10:0}, blastFlag=2, buf={0:-6}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-6}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967301, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-5:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=-17, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1658] reach_error() VAL [={0:-2147483648}, blastFlag=4, buf={0:-6}, init=1, ret=-17, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___0={-7:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.1s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1796 SdHoareTripleChecker+Valid, 57.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1796 mSDsluCounter, 8169 SdHoareTripleChecker+Invalid, 56.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4463 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2881 IncrementalHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 3706 mSDtfsCounter, 2881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=976occurred in iteration=18, InterpolantAutomatonStates: 79, 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, 21 MinimizatonAttempts, 1937 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 3445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 1288/1288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 15:09:57,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/s3.i -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 d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 15:09:58,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 15:09:58,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 15:09:58,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 15:09:58,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 15:09:58,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 15:09:58,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 15:09:58,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 15:09:58,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 15:09:58,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 15:09:58,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 15:09:58,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 15:09:58,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 15:09:58,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 15:09:58,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 15:09:58,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 15:09:58,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 15:09:58,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 15:09:58,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 15:09:58,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 15:09:58,821 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 15:09:58,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 15:09:58,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 15:09:58,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 15:09:58,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 15:09:58,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 15:09:58,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 15:09:58,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 15:09:58,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 15:09:58,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 15:09:58,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 15:09:58,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 15:09:58,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 15:09:58,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 15:09:58,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 15:09:58,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 15:09:58,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 15:09:58,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 15:09:58,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 15:09:58,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 15:09:58,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 15:09:58,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 15:09:58,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 15:09:58,870 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 15:09:58,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 15:09:58,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 15:09:58,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 15:09:58,871 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 15:09:58,871 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 15:09:58,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 15:09:58,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 15:09:58,872 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 15:09:58,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 15:09:58,873 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 15:09:58,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 15:09:58,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 15:09:58,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 15:09:58,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 15:09:58,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 15:09:58,874 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 15:09:58,874 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 15:09:58,874 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 15:09:58,874 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 15:09:58,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 15:09:58,874 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 15:09:58,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 15:09:58,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 15:09:58,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 15:09:58,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 15:09:58,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:09:58,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 15:09:58,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 15:09:58,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 15:09:58,876 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 15:09:58,876 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 15:09:58,876 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 15:09:58,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 15:09:58,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 15:09:58,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 15:09:58,877 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 -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2022-07-22 15:09:59,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 15:09:59,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 15:09:59,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 15:09:59,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 15:09:59,182 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 15:09:59,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2022-07-22 15:09:59,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a08431e/b353a68029eb480fbd438832b2d7b56c/FLAG7da6f3df7 [2022-07-22 15:09:59,573 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 15:09:59,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2022-07-22 15:09:59,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a08431e/b353a68029eb480fbd438832b2d7b56c/FLAG7da6f3df7 [2022-07-22 15:09:59,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a08431e/b353a68029eb480fbd438832b2d7b56c [2022-07-22 15:09:59,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 15:09:59,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 15:09:59,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 15:09:59,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 15:09:59,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 15:09:59,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:09:59" (1/1) ... [2022-07-22 15:09:59,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db78c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:09:59, skipping insertion in model container [2022-07-22 15:09:59,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:09:59" (1/1) ... [2022-07-22 15:09:59,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 15:10:00,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 15:10:00,294 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/loops/s3.i[64167,64180] [2022-07-22 15:10:00,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:10:00,321 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 15:10:00,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 15:10:00,398 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/loops/s3.i[64167,64180] [2022-07-22 15:10:00,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:10:00,410 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 15:10:00,453 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/loops/s3.i[64167,64180] [2022-07-22 15:10:00,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:10:00,467 INFO L208 MainTranslator]: Completed translation [2022-07-22 15:10:00,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00 WrapperNode [2022-07-22 15:10:00,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 15:10:00,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 15:10:00,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 15:10:00,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 15:10:00,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,547 INFO L137 Inliner]: procedures = 34, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 702 [2022-07-22 15:10:00,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 15:10:00,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 15:10:00,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 15:10:00,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 15:10:00,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 15:10:00,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 15:10:00,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 15:10:00,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 15:10:00,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (1/1) ... [2022-07-22 15:10:00,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:10:00,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:10:00,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 15:10:00,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 15:10:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 15:10:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 15:10:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 15:10:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 15:10:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 15:10:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 15:10:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 15:10:00,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 15:10:00,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 15:10:00,842 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 15:10:00,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 15:10:00,859 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 15:10:07,255 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-22 15:10:07,256 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-22 15:10:07,256 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 15:10:07,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 15:10:07,261 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 15:10:07,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:10:07 BoogieIcfgContainer [2022-07-22 15:10:07,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 15:10:07,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 15:10:07,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 15:10:07,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 15:10:07,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 03:09:59" (1/3) ... [2022-07-22 15:10:07,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736f121f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:10:07, skipping insertion in model container [2022-07-22 15:10:07,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:10:00" (2/3) ... [2022-07-22 15:10:07,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736f121f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:10:07, skipping insertion in model container [2022-07-22 15:10:07,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:10:07" (3/3) ... [2022-07-22 15:10:07,274 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2022-07-22 15:10:07,284 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 15:10:07,284 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 15:10:07,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 15:10:07,322 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@4d45e255, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2266db2 [2022-07-22 15:10:07,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 15:10:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 15:10:07,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:07,333 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] [2022-07-22 15:10:07,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-22 15:10:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:07,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107849146] [2022-07-22 15:10:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:07,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:07,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:07,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:10:07,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 15:10:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:07,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 15:10:07,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:10:08,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:08,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:08,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107849146] [2022-07-22 15:10:08,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107849146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:08,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:08,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:10:08,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505378552] [2022-07-22 15:10:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:08,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:10:08,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:08,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:10:08,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:08,033 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:10:08,156 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-22 15:10:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:10:08,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-22 15:10:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:10:08,168 INFO L225 Difference]: With dead ends: 375 [2022-07-22 15:10:08,169 INFO L226 Difference]: Without dead ends: 217 [2022-07-22 15:10:08,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:08,175 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:10:08,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 15:10:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-22 15:10:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-22 15:10:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-22 15:10:08,234 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-22 15:10:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:10:08,234 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-22 15:10:08,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-22 15:10:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 15:10:08,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:08,237 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] [2022-07-22 15:10:08,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 15:10:08,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:10:08,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:08,452 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-22 15:10:08,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:08,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463096689] [2022-07-22 15:10:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:08,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:08,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:08,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:10:08,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 15:10:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:08,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 15:10:08,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:10:09,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:09,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:09,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463096689] [2022-07-22 15:10:09,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463096689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:09,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:09,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:10:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560336097] [2022-07-22 15:10:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:10:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:10:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:09,024 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:11,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:10:11,175 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2022-07-22 15:10:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:10:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-07-22 15:10:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:10:11,177 INFO L225 Difference]: With dead ends: 426 [2022-07-22 15:10:11,177 INFO L226 Difference]: Without dead ends: 319 [2022-07-22 15:10:11,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:11,178 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 126 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:10:11,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 15:10:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-22 15:10:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-07-22 15:10:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4779874213836477) internal successors, (470), 318 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2022-07-22 15:10:11,186 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2022-07-22 15:10:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:10:11,187 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2022-07-22 15:10:11,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2022-07-22 15:10:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 15:10:11,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:11,192 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-22 15:10:11,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 15:10:11,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:10:11,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:11,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2022-07-22 15:10:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:11,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751942335] [2022-07-22 15:10:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:11,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:11,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:11,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:10:11,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 15:10:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:11,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 15:10:11,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 15:10:12,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:12,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:12,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751942335] [2022-07-22 15:10:12,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751942335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:12,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:12,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:10:12,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105333594] [2022-07-22 15:10:12,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:12,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:10:12,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:10:12,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:12,083 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:14,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:10:14,186 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2022-07-22 15:10:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:10:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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-22 15:10:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:10:14,188 INFO L225 Difference]: With dead ends: 632 [2022-07-22 15:10:14,188 INFO L226 Difference]: Without dead ends: 423 [2022-07-22 15:10:14,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:14,190 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:10:14,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 15:10:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-22 15:10:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-07-22 15:10:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4739336492890995) internal successors, (622), 422 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2022-07-22 15:10:14,199 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2022-07-22 15:10:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:10:14,199 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2022-07-22 15:10:14,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2022-07-22 15:10:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 15:10:14,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:14,202 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 15:10:14,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 15:10:14,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:10:14,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2022-07-22 15:10:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:14,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809571204] [2022-07-22 15:10:14,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:14,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:14,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:14,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:10:14,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 15:10:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:14,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 15:10:14,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 15:10:15,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:15,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809571204] [2022-07-22 15:10:15,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809571204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:15,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:15,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:10:15,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849423028] [2022-07-22 15:10:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:15,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:10:15,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:10:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:15,109 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-22 15:10:17,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:10:17,210 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2022-07-22 15:10:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:10:17,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 77 [2022-07-22 15:10:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:10:17,212 INFO L225 Difference]: With dead ends: 839 [2022-07-22 15:10:17,213 INFO L226 Difference]: Without dead ends: 526 [2022-07-22 15:10:17,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:17,214 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:10:17,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 15:10:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-22 15:10:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-07-22 15:10:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.4723809523809523) internal successors, (773), 525 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2022-07-22 15:10:17,228 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2022-07-22 15:10:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:10:17,229 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2022-07-22 15:10:17,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-22 15:10:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2022-07-22 15:10:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 15:10:17,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:17,233 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-22 15:10:17,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 15:10:17,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:10:17,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2022-07-22 15:10:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:17,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460370736] [2022-07-22 15:10:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:17,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:17,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:17,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:10:17,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 15:10:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:18,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 15:10:18,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:10:18,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:18,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:18,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460370736] [2022-07-22 15:10:18,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460370736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:18,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:18,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:10:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600049128] [2022-07-22 15:10:18,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:18,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:10:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:10:18,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:18,204 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:20,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:10:20,313 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2022-07-22 15:10:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:10:20,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 98 [2022-07-22 15:10:20,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:10:20,316 INFO L225 Difference]: With dead ends: 939 [2022-07-22 15:10:20,316 INFO L226 Difference]: Without dead ends: 523 [2022-07-22 15:10:20,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:10:20,317 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:10:20,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 15:10:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-22 15:10:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-07-22 15:10:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.4616858237547892) internal successors, (763), 522 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2022-07-22 15:10:20,329 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2022-07-22 15:10:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:10:20,329 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2022-07-22 15:10:20,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2022-07-22 15:10:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 15:10:20,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:20,331 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-22 15:10:20,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 15:10:20,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:10:20,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2022-07-22 15:10:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:20,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831984308] [2022-07-22 15:10:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:20,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:20,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:20,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:10:20,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 15:10:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:21,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 15:10:21,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:21,703 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-22 15:10:21,703 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-22 15:10:21,939 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-22 15:10:21,940 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-22 15:10:22,073 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:10:22,073 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-22 15:10:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 15:10:22,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:22,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:22,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831984308] [2022-07-22 15:10:22,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831984308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:22,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:22,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:10:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883523883] [2022-07-22 15:10:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:22,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:10:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:10:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:10:22,117 INFO L87 Difference]: Start difference. First operand 523 states and 763 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:24,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:29,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:10:29,772 INFO L93 Difference]: Finished difference Result 1191 states and 1739 transitions. [2022-07-22 15:10:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:10:29,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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-22 15:10:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:10:29,776 INFO L225 Difference]: With dead ends: 1191 [2022-07-22 15:10:29,776 INFO L226 Difference]: Without dead ends: 675 [2022-07-22 15:10:29,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:10:29,777 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-22 15:10:29,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 1 Unknown, 30 Unchecked, 7.6s Time] [2022-07-22 15:10:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-07-22 15:10:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 607. [2022-07-22 15:10:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 1.49009900990099) internal successors, (903), 606 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 903 transitions. [2022-07-22 15:10:29,788 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 903 transitions. Word has length 100 [2022-07-22 15:10:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:10:29,789 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 903 transitions. [2022-07-22 15:10:29,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 903 transitions. [2022-07-22 15:10:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 15:10:29,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:29,790 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-07-22 15:10:29,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 15:10:30,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:10:30,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2022-07-22 15:10:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:30,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314849580] [2022-07-22 15:10:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:30,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:30,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:30,015 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:10:30,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 15:10:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:31,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 15:10:31,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:31,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:10:31,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:10:31,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:10:31,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:10:31,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:10:31,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:10:31,897 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-22 15:10:31,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-22 15:10:32,567 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:10:32,567 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 70 treesize of output 22 [2022-07-22 15:10:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:10:32,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:32,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:32,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314849580] [2022-07-22 15:10:32,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314849580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:32,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:32,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:10:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498783390] [2022-07-22 15:10:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:32,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:10:32,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:32,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:10:32,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:10:32,599 INFO L87 Difference]: Start difference. First operand 607 states and 903 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:34,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:36,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:44,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:10:45,021 INFO L93 Difference]: Finished difference Result 1413 states and 2092 transitions. [2022-07-22 15:10:45,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:10:45,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-22 15:10:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:10:45,036 INFO L225 Difference]: With dead ends: 1413 [2022-07-22 15:10:45,037 INFO L226 Difference]: Without dead ends: 813 [2022-07-22 15:10:45,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:10:45,042 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 46 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:10:45,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 508 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 12.3s Time] [2022-07-22 15:10:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-22 15:10:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 703. [2022-07-22 15:10:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 1.5256410256410255) internal successors, (1071), 702 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1071 transitions. [2022-07-22 15:10:45,090 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1071 transitions. Word has length 100 [2022-07-22 15:10:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:10:45,091 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1071 transitions. [2022-07-22 15:10:45,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1071 transitions. [2022-07-22 15:10:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-22 15:10:45,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:45,092 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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-22 15:10:45,115 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-22 15:10:45,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:10:45,308 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2022-07-22 15:10:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:45,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429560200] [2022-07-22 15:10:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:45,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:45,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:45,310 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-22 15:10:45,311 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-22 15:10:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:47,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:10:47,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:47,921 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-22 15:10:47,922 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:10:47,987 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:10:47,987 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 43 treesize of output 13 [2022-07-22 15:10:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:10:48,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:48,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:48,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429560200] [2022-07-22 15:10:48,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429560200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:48,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:48,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:10:48,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053971040] [2022-07-22 15:10:48,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:48,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:10:48,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:48,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:10:48,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:10:48,019 INFO L87 Difference]: Start difference. First operand 703 states and 1071 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:50,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:52,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:10:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:10:53,759 INFO L93 Difference]: Finished difference Result 1464 states and 2226 transitions. [2022-07-22 15:10:53,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:10:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-07-22 15:10:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:10:53,770 INFO L225 Difference]: With dead ends: 1464 [2022-07-22 15:10:53,772 INFO L226 Difference]: Without dead ends: 768 [2022-07-22 15:10:53,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:10:53,773 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-22 15:10:53,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 1 Unknown, 15 Unchecked, 5.7s Time] [2022-07-22 15:10:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-07-22 15:10:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2022-07-22 15:10:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.5032594524119949) internal successors, (1153), 767 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1153 transitions. [2022-07-22 15:10:53,792 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1153 transitions. Word has length 115 [2022-07-22 15:10:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:10:53,792 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1153 transitions. [2022-07-22 15:10:53,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1153 transitions. [2022-07-22 15:10:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-22 15:10:53,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:10:53,796 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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-22 15:10:53,824 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-22 15:10:54,003 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-22 15:10:54,004 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:10:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:10:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2022-07-22 15:10:54,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:10:54,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192756177] [2022-07-22 15:10:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:10:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:10:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:10:54,006 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:10:54,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-22 15:10:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:10:55,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:10:55,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:10:55,939 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-22 15:10:55,939 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:10:56,010 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:10:56,010 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 43 treesize of output 13 [2022-07-22 15:10:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:10:56,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:10:56,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:10:56,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192756177] [2022-07-22 15:10:56,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192756177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:10:56,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:10:56,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:10:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854331801] [2022-07-22 15:10:56,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:10:56,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:10:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:10:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:10:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:10:56,051 INFO L87 Difference]: Start difference. First operand 768 states and 1153 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:10:58,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:11:02,289 INFO L93 Difference]: Finished difference Result 1534 states and 2305 transitions. [2022-07-22 15:11:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:11:02,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-07-22 15:11:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:11:02,304 INFO L225 Difference]: With dead ends: 1534 [2022-07-22 15:11:02,304 INFO L226 Difference]: Without dead ends: 773 [2022-07-22 15:11:02,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:11:02,307 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:11:02,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 1 Unknown, 18 Unchecked, 6.2s Time] [2022-07-22 15:11:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-07-22 15:11:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2022-07-22 15:11:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4896373056994818) internal successors, (1150), 772 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1150 transitions. [2022-07-22 15:11:02,334 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1150 transitions. Word has length 115 [2022-07-22 15:11:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:11:02,335 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1150 transitions. [2022-07-22 15:11:02,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1150 transitions. [2022-07-22 15:11:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-22 15:11:02,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:11:02,339 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2022-07-22 15:11:02,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-22 15:11:02,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:11:02,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:11:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:11:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -647023955, now seen corresponding path program 1 times [2022-07-22 15:11:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:11:02,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697798882] [2022-07-22 15:11:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:11:02,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:11:02,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:11:02,559 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:11:02,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-22 15:11:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:11:03,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:11:03,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:11:04,328 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-22 15:11:04,329 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:11:04,426 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:11:04,427 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 43 treesize of output 13 [2022-07-22 15:11:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:11:04,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:11:04,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:11:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697798882] [2022-07-22 15:11:04,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697798882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:11:04,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:11:04,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:11:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752700083] [2022-07-22 15:11:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:11:04,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:11:04,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:11:04,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:11:04,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:11:04,472 INFO L87 Difference]: Start difference. First operand 773 states and 1150 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:06,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:10,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:11:11,435 INFO L93 Difference]: Finished difference Result 1415 states and 2093 transitions. [2022-07-22 15:11:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:11:11,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-07-22 15:11:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:11:11,440 INFO L225 Difference]: With dead ends: 1415 [2022-07-22 15:11:11,440 INFO L226 Difference]: Without dead ends: 809 [2022-07-22 15:11:11,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:11:11,442 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 20 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-22 15:11:11,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 460 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 1 Unknown, 19 Unchecked, 6.9s Time] [2022-07-22 15:11:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-22 15:11:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 773. [2022-07-22 15:11:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4844559585492227) internal successors, (1146), 772 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1146 transitions. [2022-07-22 15:11:11,485 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1146 transitions. Word has length 115 [2022-07-22 15:11:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:11:11,485 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1146 transitions. [2022-07-22 15:11:11,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1146 transitions. [2022-07-22 15:11:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 15:11:11,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:11:11,487 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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-22 15:11:11,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-22 15:11:11,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:11:11,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:11:11,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:11:11,695 INFO L85 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2022-07-22 15:11:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:11:11,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271979339] [2022-07-22 15:11:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:11:11,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:11:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:11:11,697 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:11:11,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-22 15:11:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:11:14,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:11:14,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:11:14,495 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-22 15:11:14,495 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:11:14,581 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:11:14,581 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 43 treesize of output 13 [2022-07-22 15:11:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:11:14,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:11:14,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:11:14,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271979339] [2022-07-22 15:11:14,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271979339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:11:14,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:11:14,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:11:14,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106544898] [2022-07-22 15:11:14,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:11:14,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:11:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:11:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:11:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:11:14,621 INFO L87 Difference]: Start difference. First operand 773 states and 1146 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:16,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:21,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:11:21,432 INFO L93 Difference]: Finished difference Result 1544 states and 2291 transitions. [2022-07-22 15:11:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:11:21,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-07-22 15:11:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:11:21,438 INFO L225 Difference]: With dead ends: 1544 [2022-07-22 15:11:21,438 INFO L226 Difference]: Without dead ends: 778 [2022-07-22 15:11:21,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:11:21,439 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-22 15:11:21,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 2 Unknown, 17 Unchecked, 6.7s Time] [2022-07-22 15:11:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-22 15:11:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-07-22 15:11:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.471042471042471) internal successors, (1143), 777 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1143 transitions. [2022-07-22 15:11:21,456 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1143 transitions. Word has length 116 [2022-07-22 15:11:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:11:21,457 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1143 transitions. [2022-07-22 15:11:21,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1143 transitions. [2022-07-22 15:11:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 15:11:21,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:11:21,458 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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] [2022-07-22 15:11:21,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-22 15:11:21,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:11:21,672 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:11:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:11:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash -710278962, now seen corresponding path program 1 times [2022-07-22 15:11:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:11:21,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197017666] [2022-07-22 15:11:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:11:21,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:11:21,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:11:21,675 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:11:21,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-22 15:11:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:11:23,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:11:23,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:11:23,500 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-22 15:11:23,501 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:11:23,606 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:11:23,607 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 43 treesize of output 13 [2022-07-22 15:11:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:11:23,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:11:23,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:11:23,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197017666] [2022-07-22 15:11:23,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197017666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:11:23,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:11:23,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:11:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069462165] [2022-07-22 15:11:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:11:23,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:11:23,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:11:23,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:11:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:11:23,639 INFO L87 Difference]: Start difference. First operand 778 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:25,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:31,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:11:31,533 INFO L93 Difference]: Finished difference Result 1424 states and 2081 transitions. [2022-07-22 15:11:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:11:31,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-07-22 15:11:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:11:31,538 INFO L225 Difference]: With dead ends: 1424 [2022-07-22 15:11:31,538 INFO L226 Difference]: Without dead ends: 814 [2022-07-22 15:11:31,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:11:31,539 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 19 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-22 15:11:31,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 458 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 1 Unknown, 20 Unchecked, 7.8s Time] [2022-07-22 15:11:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-07-22 15:11:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 778. [2022-07-22 15:11:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.465894465894466) internal successors, (1139), 777 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1139 transitions. [2022-07-22 15:11:31,553 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1139 transitions. Word has length 116 [2022-07-22 15:11:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:11:31,554 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1139 transitions. [2022-07-22 15:11:31,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1139 transitions. [2022-07-22 15:11:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-22 15:11:31,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:11:31,555 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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-22 15:11:31,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-22 15:11:31,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:11:31,777 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:11:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:11:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2022-07-22 15:11:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:11:31,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376141667] [2022-07-22 15:11:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:11:31,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:11:31,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:11:31,780 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:11:31,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-22 15:11:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:11:33,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:11:33,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:11:33,857 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-22 15:11:33,858 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:11:33,944 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:11:33,944 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 43 treesize of output 13 [2022-07-22 15:11:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:11:33,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:11:33,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:11:33,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376141667] [2022-07-22 15:11:33,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376141667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:11:33,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:11:33,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:11:33,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114840999] [2022-07-22 15:11:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:11:33,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:11:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:11:33,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:11:33,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:11:33,975 INFO L87 Difference]: Start difference. First operand 778 states and 1139 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:35,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:37,654 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-22 15:11:39,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:11:40,675 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-07-22 15:11:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:11:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-22 15:11:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:11:40,687 INFO L225 Difference]: With dead ends: 1554 [2022-07-22 15:11:40,687 INFO L226 Difference]: Without dead ends: 783 [2022-07-22 15:11:40,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:11:40,689 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-22 15:11:40,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 1 Unknown, 19 Unchecked, 6.6s Time] [2022-07-22 15:11:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-07-22 15:11:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2022-07-22 15:11:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4526854219948848) internal successors, (1136), 782 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1136 transitions. [2022-07-22 15:11:40,703 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1136 transitions. Word has length 117 [2022-07-22 15:11:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:11:40,704 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1136 transitions. [2022-07-22 15:11:40,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1136 transitions. [2022-07-22 15:11:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-22 15:11:40,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:11:40,705 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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-22 15:11:40,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-22 15:11:40,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:11:40,915 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:11:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:11:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2022-07-22 15:11:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:11:40,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425751409] [2022-07-22 15:11:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:11:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:11:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:11:40,918 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:11:40,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-22 15:11:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:11:42,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:11:42,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:11:42,980 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-22 15:11:42,980 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:11:43,076 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:11:43,077 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 43 treesize of output 13 [2022-07-22 15:11:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:11:43,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:11:43,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:11:43,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425751409] [2022-07-22 15:11:43,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425751409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:11:43,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:11:43,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:11:43,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410349856] [2022-07-22 15:11:43,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:11:43,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:11:43,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:11:43,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:11:43,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:11:43,127 INFO L87 Difference]: Start difference. First operand 783 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:45,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:46,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:11:49,146 INFO L93 Difference]: Finished difference Result 1564 states and 2271 transitions. [2022-07-22 15:11:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:11:49,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-22 15:11:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:11:49,150 INFO L225 Difference]: With dead ends: 1564 [2022-07-22 15:11:49,150 INFO L226 Difference]: Without dead ends: 788 [2022-07-22 15:11:49,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:11:49,151 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:11:49,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 431 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 1 Unknown, 21 Unchecked, 6.0s Time] [2022-07-22 15:11:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-22 15:11:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-22 15:11:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4396442185514613) internal successors, (1133), 787 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1133 transitions. [2022-07-22 15:11:49,186 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1133 transitions. Word has length 118 [2022-07-22 15:11:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:11:49,187 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1133 transitions. [2022-07-22 15:11:49,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1133 transitions. [2022-07-22 15:11:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-22 15:11:49,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:11:49,188 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2022-07-22 15:11:49,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-22 15:11:49,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:11:49,414 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:11:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:11:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2022-07-22 15:11:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:11:49,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149433081] [2022-07-22 15:11:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:11:49,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:11:49,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:11:49,416 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:11:49,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-22 15:11:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:11:51,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:11:51,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:11:51,766 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-22 15:11:51,766 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:11:51,890 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:11:51,891 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 43 treesize of output 13 [2022-07-22 15:11:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:11:51,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:11:51,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:11:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149433081] [2022-07-22 15:11:51,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149433081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:11:51,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:11:51,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:11:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903007901] [2022-07-22 15:11:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:11:51,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:11:51,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:11:51,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:11:51,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:11:51,925 INFO L87 Difference]: Start difference. First operand 788 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:53,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:11:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:11:58,116 INFO L93 Difference]: Finished difference Result 1569 states and 2255 transitions. [2022-07-22 15:11:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:11:58,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-22 15:11:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:11:58,123 INFO L225 Difference]: With dead ends: 1569 [2022-07-22 15:11:58,123 INFO L226 Difference]: Without dead ends: 788 [2022-07-22 15:11:58,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:11:58,127 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:11:58,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 18 Unchecked, 6.1s Time] [2022-07-22 15:11:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-22 15:11:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-22 15:11:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.434561626429479) internal successors, (1129), 787 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1129 transitions. [2022-07-22 15:11:58,150 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1129 transitions. Word has length 118 [2022-07-22 15:11:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:11:58,150 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1129 transitions. [2022-07-22 15:11:58,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:11:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1129 transitions. [2022-07-22 15:11:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-22 15:11:58,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:11:58,152 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 15:11:58,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-22 15:11:58,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:11:58,367 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:11:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:11:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1781105215, now seen corresponding path program 1 times [2022-07-22 15:11:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:11:58,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016148106] [2022-07-22 15:11:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:11:58,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:11:58,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:11:58,370 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:11:58,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-22 15:12:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:12:00,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:12:00,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:12:01,118 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-22 15:12:01,118 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:12:01,360 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:12:01,361 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 43 treesize of output 13 [2022-07-22 15:12:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:12:01,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:12:01,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:12:01,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016148106] [2022-07-22 15:12:01,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016148106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:12:01,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:12:01,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:12:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612264707] [2022-07-22 15:12:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:12:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:12:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:12:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:12:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:12:01,424 INFO L87 Difference]: Start difference. First operand 788 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:03,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:05,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:12:08,978 INFO L93 Difference]: Finished difference Result 1583 states and 2264 transitions. [2022-07-22 15:12:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:12:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-22 15:12:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:12:08,984 INFO L225 Difference]: With dead ends: 1583 [2022-07-22 15:12:08,984 INFO L226 Difference]: Without dead ends: 802 [2022-07-22 15:12:08,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:12:08,986 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-22 15:12:08,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 1 Unknown, 22 Unchecked, 7.5s Time] [2022-07-22 15:12:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-22 15:12:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-22 15:12:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4294790343074968) internal successors, (1125), 787 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1125 transitions. [2022-07-22 15:12:09,016 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1125 transitions. Word has length 118 [2022-07-22 15:12:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:12:09,016 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1125 transitions. [2022-07-22 15:12:09,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1125 transitions. [2022-07-22 15:12:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-22 15:12:09,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:12:09,018 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 15:12:09,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-22 15:12:09,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:12:09,237 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:12:09,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:12:09,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1012937024, now seen corresponding path program 1 times [2022-07-22 15:12:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:12:09,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095082667] [2022-07-22 15:12:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:12:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:12:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:12:09,240 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:12:09,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-22 15:12:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:12:11,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:12:11,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:12:11,997 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-22 15:12:11,997 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:12:12,174 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:12:12,174 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 43 treesize of output 13 [2022-07-22 15:12:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:12:12,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:12:12,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:12:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095082667] [2022-07-22 15:12:12,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095082667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:12:12,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:12:12,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:12:12,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448976204] [2022-07-22 15:12:12,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:12:12,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:12:12,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:12:12,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:12:12,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:12:12,218 INFO L87 Difference]: Start difference. First operand 788 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:14,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:17,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:12:19,531 INFO L93 Difference]: Finished difference Result 1583 states and 2256 transitions. [2022-07-22 15:12:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:12:19,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-07-22 15:12:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:12:19,537 INFO L225 Difference]: With dead ends: 1583 [2022-07-22 15:12:19,537 INFO L226 Difference]: Without dead ends: 802 [2022-07-22 15:12:19,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:12:19,538 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:12:19,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 24 Unchecked, 7.2s Time] [2022-07-22 15:12:19,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-22 15:12:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 788. [2022-07-22 15:12:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4243964421855146) internal successors, (1121), 787 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-22 15:12:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1121 transitions. [2022-07-22 15:12:19,554 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1121 transitions. Word has length 119 [2022-07-22 15:12:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:12:19,554 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1121 transitions. [2022-07-22 15:12:19,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1121 transitions. [2022-07-22 15:12:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-22 15:12:19,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:12:19,556 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2022-07-22 15:12:19,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-22 15:12:19,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:12:19,776 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:12:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:12:19,776 INFO L85 PathProgramCache]: Analyzing trace with hash 405159276, now seen corresponding path program 1 times [2022-07-22 15:12:19,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:12:19,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67406038] [2022-07-22 15:12:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:12:19,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:12:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:12:19,779 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:12:19,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-22 15:12:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:12:21,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:12:21,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:12:22,239 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-22 15:12:22,239 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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-22 15:12:22,406 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 15:12:22,407 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 43 treesize of output 13 [2022-07-22 15:12:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 15:12:22,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:12:22,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:12:22,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67406038] [2022-07-22 15:12:22,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67406038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:12:22,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:12:22,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:12:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154613529] [2022-07-22 15:12:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:12:22,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:12:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:12:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:12:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:12:22,451 INFO L87 Difference]: Start difference. First operand 788 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:24,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:27,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:12:29,562 INFO L93 Difference]: Finished difference Result 1569 states and 2231 transitions. [2022-07-22 15:12:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:12:29,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-07-22 15:12:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:12:29,567 INFO L225 Difference]: With dead ends: 1569 [2022-07-22 15:12:29,567 INFO L226 Difference]: Without dead ends: 788 [2022-07-22 15:12:29,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:12:29,568 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:12:29,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 442 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 1 Unknown, 18 Unchecked, 7.1s Time] [2022-07-22 15:12:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-22 15:12:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-07-22 15:12:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4193138500635325) internal successors, (1117), 787 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1117 transitions. [2022-07-22 15:12:29,585 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1117 transitions. Word has length 119 [2022-07-22 15:12:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:12:29,585 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1117 transitions. [2022-07-22 15:12:29,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1117 transitions. [2022-07-22 15:12:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 15:12:29,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:12:29,587 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2022-07-22 15:12:29,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-22 15:12:29,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:12:29,802 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:12:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:12:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2022-07-22 15:12:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:12:29,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140189599] [2022-07-22 15:12:29,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:12:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:12:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:12:29,805 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:12:29,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-22 15:12:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:12:32,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 15:12:32,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:12:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:12:32,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:32,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-22 15:12:35,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:35,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:12:35,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-22 15:12:35,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:12:35,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-22 15:12:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-22 15:12:35,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:12:35,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:12:35,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140189599] [2022-07-22 15:12:35,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140189599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:12:35,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:12:35,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:12:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728736392] [2022-07-22 15:12:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:12:35,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:12:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:12:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:12:35,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:12:35,888 INFO L87 Difference]: Start difference. First operand 788 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:37,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:12:37,946 INFO L93 Difference]: Finished difference Result 1419 states and 2013 transitions. [2022-07-22 15:12:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:12:37,947 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 122 [2022-07-22 15:12:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:12:37,949 INFO L225 Difference]: With dead ends: 1419 [2022-07-22 15:12:37,949 INFO L226 Difference]: Without dead ends: 801 [2022-07-22 15:12:37,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:12:37,950 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 8 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:12:37,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 85 Unchecked, 2.0s Time] [2022-07-22 15:12:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-07-22 15:12:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2022-07-22 15:12:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.4223057644110275) internal successors, (1135), 798 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1135 transitions. [2022-07-22 15:12:37,967 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1135 transitions. Word has length 122 [2022-07-22 15:12:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:12:37,967 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1135 transitions. [2022-07-22 15:12:37,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1135 transitions. [2022-07-22 15:12:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-22 15:12:37,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:12:37,969 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2022-07-22 15:12:37,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-22 15:12:38,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:12:38,184 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:12:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:12:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash 787843816, now seen corresponding path program 1 times [2022-07-22 15:12:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:12:38,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147228466] [2022-07-22 15:12:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:12:38,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:12:38,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:12:38,186 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:12:38,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-22 15:12:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:12:40,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 15:12:40,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:12:40,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:12:40,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:40,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-22 15:12:43,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:43,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:12:43,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-22 15:12:44,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:12:44,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-22 15:12:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-22 15:12:44,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:12:44,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:12:44,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147228466] [2022-07-22 15:12:44,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147228466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:12:44,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:12:44,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:12:44,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471021263] [2022-07-22 15:12:44,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:12:44,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:12:44,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:12:44,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:12:44,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:12:44,205 INFO L87 Difference]: Start difference. First operand 799 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:46,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:12:46,282 INFO L93 Difference]: Finished difference Result 1420 states and 2014 transitions. [2022-07-22 15:12:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:12:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-22 15:12:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:12:46,290 INFO L225 Difference]: With dead ends: 1420 [2022-07-22 15:12:46,290 INFO L226 Difference]: Without dead ends: 802 [2022-07-22 15:12:46,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:12:46,291 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 8 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:12:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 401 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 85 Unchecked, 2.1s Time] [2022-07-22 15:12:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-22 15:12:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2022-07-22 15:12:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.4217772215269087) internal successors, (1136), 799 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1136 transitions. [2022-07-22 15:12:46,306 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1136 transitions. Word has length 123 [2022-07-22 15:12:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:12:46,307 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1136 transitions. [2022-07-22 15:12:46,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1136 transitions. [2022-07-22 15:12:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-22 15:12:46,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:12:46,309 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2022-07-22 15:12:46,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-22 15:12:46,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:12:46,532 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:12:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:12:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1698524401, now seen corresponding path program 1 times [2022-07-22 15:12:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:12:46,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821026334] [2022-07-22 15:12:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:12:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:12:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:12:46,534 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:12:46,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-22 15:12:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:12:49,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 15:12:49,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:12:49,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:12:49,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:49,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-22 15:12:52,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:12:52,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:12:52,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-22 15:12:53,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:12:53,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-22 15:12:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-22 15:12:53,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:12:53,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:12:53,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821026334] [2022-07-22 15:12:53,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821026334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:12:53,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:12:53,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:12:53,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424241963] [2022-07-22 15:12:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:12:53,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:12:53,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:12:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:12:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:12:53,168 INFO L87 Difference]: Start difference. First operand 800 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:55,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:12:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:12:57,337 INFO L93 Difference]: Finished difference Result 1428 states and 2027 transitions. [2022-07-22 15:12:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:12:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-22 15:12:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:12:57,340 INFO L225 Difference]: With dead ends: 1428 [2022-07-22 15:12:57,340 INFO L226 Difference]: Without dead ends: 810 [2022-07-22 15:12:57,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 15:12:57,344 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:12:57,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 436 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 102 Unchecked, 2.1s Time] [2022-07-22 15:12:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-22 15:12:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2022-07-22 15:12:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.4237918215613383) internal successors, (1149), 807 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1149 transitions. [2022-07-22 15:12:57,387 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1149 transitions. Word has length 123 [2022-07-22 15:12:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:12:57,387 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1149 transitions. [2022-07-22 15:12:57,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:12:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1149 transitions. [2022-07-22 15:12:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-22 15:12:57,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:12:57,389 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2022-07-22 15:12:57,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-22 15:12:57,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:12:57,596 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:12:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:12:57,596 INFO L85 PathProgramCache]: Analyzing trace with hash -935560660, now seen corresponding path program 1 times [2022-07-22 15:12:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:12:57,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834094515] [2022-07-22 15:12:57,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:12:57,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:12:57,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:12:57,598 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:12:57,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-22 15:13:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:13:00,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 15:13:00,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:13:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:13:00,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:00,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 69 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 109 [2022-07-22 15:13:03,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:13:03,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:13:03,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 141 [2022-07-22 15:13:03,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:13:03,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 42 [2022-07-22 15:13:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-22 15:13:04,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 15:13:04,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 15:13:04,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834094515] [2022-07-22 15:13:04,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834094515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:13:04,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:13:04,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 15:13:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259512724] [2022-07-22 15:13:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:13:04,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 15:13:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 15:13:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 15:13:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:13:04,008 INFO L87 Difference]: Start difference. First operand 808 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:13:06,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 15:13:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:13:06,073 INFO L93 Difference]: Finished difference Result 1429 states and 2028 transitions. [2022-07-22 15:13:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 15:13:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-07-22 15:13:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:13:06,076 INFO L225 Difference]: With dead ends: 1429 [2022-07-22 15:13:06,076 INFO L226 Difference]: Without dead ends: 811 [2022-07-22 15:13:06,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 15:13:06,076 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:13:06,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 436 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 101 Unchecked, 2.1s Time] [2022-07-22 15:13:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-07-22 15:13:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 797. [2022-07-22 15:13:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.420854271356784) internal successors, (1131), 796 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:13:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1131 transitions. [2022-07-22 15:13:06,094 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1131 transitions. Word has length 124 [2022-07-22 15:13:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:13:06,095 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1131 transitions. [2022-07-22 15:13:06,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:13:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1131 transitions. [2022-07-22 15:13:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 15:13:06,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:13:06,096 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1] [2022-07-22 15:13:06,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-22 15:13:06,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:13:06,315 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:13:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:13:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-22 15:13:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 15:13:06,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229271483] [2022-07-22 15:13:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:13:06,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 15:13:06,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 15:13:06,318 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 15:13:06,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-22 15:13:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 15:13:11,170 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 15:13:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 15:13:14,028 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-22 15:13:14,028 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 15:13:14,029 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 15:13:14,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-22 15:13:14,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 15:13:14,263 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] [2022-07-22 15:13:14,266 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 15:13:14,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 03:13:14 BoogieIcfgContainer [2022-07-22 15:13:14,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 15:13:14,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 15:13:14,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 15:13:14,404 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 15:13:14,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:10:07" (3/4) ... [2022-07-22 15:13:14,414 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 15:13:14,506 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 15:13:14,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 15:13:14,508 INFO L158 Benchmark]: Toolchain (without parser) took 194538.21ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 33.3MB in the beginning and 28.9MB in the end (delta: 4.4MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2022-07-22 15:13:14,508 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 37.5MB in the end (delta: 30.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 15:13:14,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.46ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.1MB in the beginning and 40.7MB in the end (delta: -7.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-07-22 15:13:14,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.17ms. Allocated memory is still 73.4MB. Free memory was 40.4MB in the beginning and 36.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 15:13:14,514 INFO L158 Benchmark]: Boogie Preprocessor took 81.87ms. Allocated memory is still 73.4MB. Free memory was 36.0MB in the beginning and 45.2MB in the end (delta: -9.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-07-22 15:13:14,514 INFO L158 Benchmark]: RCFGBuilder took 6625.21ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 45.2MB in the beginning and 23.5MB in the end (delta: 21.6MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2022-07-22 15:13:14,514 INFO L158 Benchmark]: TraceAbstraction took 187135.01ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 29.9MB in the end (delta: 29.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-07-22 15:13:14,514 INFO L158 Benchmark]: Witness Printer took 102.51ms. Allocated memory is still 88.1MB. Free memory was 29.9MB in the beginning and 28.9MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 15:13:14,517 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 37.5MB in the end (delta: 30.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.46ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.1MB in the beginning and 40.7MB in the end (delta: -7.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.17ms. Allocated memory is still 73.4MB. Free memory was 40.4MB in the beginning and 36.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.87ms. Allocated memory is still 73.4MB. Free memory was 36.0MB in the beginning and 45.2MB in the end (delta: -9.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 6625.21ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 45.2MB in the beginning and 23.5MB in the end (delta: 21.6MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * TraceAbstraction took 187135.01ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 29.9MB in the end (delta: 29.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 102.51ms. Allocated memory is still 88.1MB. Free memory was 29.9MB in the beginning and 28.9MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1658]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1065] SSL *s ; [L1069] s = malloc (sizeof (SSL)) [L1070] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] EXPR s->s3 [L1071] s->s3->flags = __VERIFIER_nondet_long() [L1072] EXPR s->s3 [L1072] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1073] EXPR s->s3 [L1073] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1074] EXPR s->s3 [L1074] EXPR (s->s3)->tmp.new_cipher [L1074] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1075] EXPR s->s3 [L1075] s->s3->tmp.next_state = __VERIFIER_nondet_int() [L1076] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1077] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1078] s->ctx = malloc(sizeof(SSL_CTX)) [L1079] EXPR s->ctx [L1079] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1080] s->state = 12292 [L1081] s->version = __VERIFIER_nondet_int() [L1082] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1083] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1084] CALL ssl3_connect(s) [L1090] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1091] unsigned long tmp ; [L1092] unsigned long l ; [L1093] long num1 ; [L1094] void (*cb)() ; [L1095] int ret ; [L1096] int new_state ; [L1097] int state ; [L1098] int skip ; [L1099] int *tmp___0 ; [L1100] int tmp___1 = __VERIFIER_nondet_int(); [L1101] int tmp___2 = __VERIFIER_nondet_int(); [L1102] int tmp___3 ; [L1103] int tmp___4 ; [L1104] int tmp___5 ; [L1105] int tmp___6 ; [L1106] int tmp___7 ; [L1107] int tmp___8 ; [L1108] long tmp___9 ; [L1110] int blastFlag ; [L1113] blastFlag = 0 [L1114] s->state = 12292 [L1115] s->hit = __VERIFIER_nondet_int() [L1117] tmp = __VERIFIER_nondet_int() [L1118] cb = (void (*)())((void *)0) [L1119] ret = -1 [L1120] skip = 0 [L1121] tmp___0 = (int*)malloc(sizeof(int)) [L1122] *tmp___0 = 0 [L1123] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->info_callback={0:-2147467264}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}] [L1123] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1124] EXPR s->info_callback [L1124] cb = s->info_callback [L1132] EXPR s->in_handshake [L1132] s->in_handshake += 1 [L1133] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}, tmp___1=0] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, tmp___0={6:0}, tmp___1=0] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1146] COND TRUE s->state == 12292 [L1249] s->new_session = 1 [L1250] s->state = 4096 [L1251] EXPR s->ctx [L1251] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1251] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1256] s->server = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1257] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1262] EXPR s->version VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->version=768, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1262] COND FALSE !((s->version & 65280) != 768) [L1268] s->type = 4096 [L1269] EXPR s->init_buf VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->init_buf={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0] [L1269] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1281] tmp___4 = __VERIFIER_nondet_int() [L1282] COND FALSE !(! tmp___4) [L1288] tmp___5 = __VERIFIER_nondet_int() [L1289] COND FALSE !(! tmp___5) [L1295] s->state = 4368 [L1296] EXPR s->ctx [L1296] EXPR (s->ctx)->stats.sess_connect [L1296] (s->ctx)->stats.sess_connect += 1 [L1297] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=0, buf=null, init=1, ret=4294967295, s={1073741859:0}, s={1073741859:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND TRUE s->state == 4368 [L1301] s->shutdown = 0 [L1302] ret = __VERIFIER_nondet_int() [L1303] COND TRUE blastFlag == 0 [L1304] blastFlag = 1 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1308] COND FALSE !(ret <= 0) [L1313] s->state = 4384 [L1314] s->init_num = 0 [L1315] EXPR s->bbio [L1315] EXPR s->wbio VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->bbio={0:-2147483648}, s->wbio={0:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1315] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=1, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND TRUE s->state == 4384 [L1323] ret = __VERIFIER_nondet_int() [L1324] COND TRUE blastFlag == 1 [L1325] blastFlag = 2 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1329] COND FALSE !(ret <= 0) [L1334] s->hit VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1334] COND FALSE !(s->hit) [L1337] s->state = 4400 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1339] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1173] COND TRUE s->state == 4400 [L1343] EXPR s->s3 [L1343] EXPR (s->s3)->tmp.new_cipher [L1343] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147467264}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={34:0}, blastFlag=2, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1343] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1346] ret = __VERIFIER_nondet_int() [L1347] COND TRUE blastFlag == 2 [L1348] blastFlag = 3 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1352] COND FALSE !(ret <= 0) VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1358] s->state = 4416 [L1359] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=3, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1179] COND TRUE s->state == 4416 [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 3 [L1365] blastFlag = 4 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648] [L1369] COND FALSE !(ret <= 0) [L1374] s->state = 4432 [L1375] s->init_num = 0 [L1376] tmp___6 = __VERIFIER_nondet_int() [L1377] COND FALSE !(! tmp___6) VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1185] COND TRUE s->state == 4432 [L1386] ret = __VERIFIER_nondet_int() [L1387] COND FALSE !(blastFlag == 5) VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1392] COND FALSE !(ret <= 0) [L1397] s->state = 4448 [L1398] s->init_num = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] EXPR s->s3 [L1617] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147467264}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->s3={5:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1617] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1646] skip = 0 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1143] COND TRUE 1 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1145] EXPR s->state [L1145] state = s->state [L1146] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1146] COND FALSE !(s->state == 12292) [L1149] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1149] COND FALSE !(s->state == 16384) [L1152] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1152] COND FALSE !(s->state == 4096) [L1155] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1155] COND FALSE !(s->state == 20480) [L1158] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1158] COND FALSE !(s->state == 4099) [L1161] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1161] COND FALSE !(s->state == 4368) [L1164] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1164] COND FALSE !(s->state == 4369) [L1167] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1167] COND FALSE !(s->state == 4384) [L1170] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1170] COND FALSE !(s->state == 4385) [L1173] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1173] COND FALSE !(s->state == 4400) [L1176] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1176] COND FALSE !(s->state == 4401) [L1179] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1179] COND FALSE !(s->state == 4416) [L1182] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1182] COND FALSE !(s->state == 4417) [L1185] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1185] COND FALSE !(s->state == 4432) [L1188] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1188] COND FALSE !(s->state == 4433) [L1191] EXPR s->state VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=1073741824, s={1073741859:0}, s={1073741859:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1191] COND TRUE s->state == 4448 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=9, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] [L1658] reach_error() VAL [={0:-2147467264}, blastFlag=4, buf=null, init=1, ret=9, s={1073741859:0}, s={1073741859:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp___0={6:0}, tmp___1=0, tmp___4=2147483648, tmp___5=2147483648, tmp___6=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 187.0s, OverallIterations: 23, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 113.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 23 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 110.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 9805 SdHoareTripleChecker+Invalid, 107.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 614 IncrementalHoareTripleChecker+Unchecked, 5282 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1354 IncrementalHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 4523 mSDtfsCounter, 1354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2265 GetRequests, 2211 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=21, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 298 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 29.0s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 2410 NumberOfCodeBlocks, 2410 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2251 ConstructedInterpolants, 56 QuantifiedInterpolants, 8185 SizeOfPredicates, 67 NumberOfNonLiveVariables, 20556 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 3098/3098 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-22 15:13:14,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE