./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:11:49,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:11:49,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:11:49,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:11:49,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:11:49,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:11:49,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:11:49,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:11:49,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:11:49,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:11:49,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:11:49,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:11:49,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:11:49,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:11:49,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:11:49,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:11:49,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:11:49,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:11:49,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:11:49,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:11:49,644 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:11:49,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:11:49,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:11:49,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:11:49,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:11:49,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:11:49,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:11:49,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:11:49,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:11:49,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:11:49,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:11:49,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:11:49,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:11:49,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:11:49,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:11:49,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:11:49,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:11:49,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:11:49,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:11:49,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:11:49,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:11:49,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:11:49,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:11:49,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:11:49,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:11:49,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:11:49,697 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:11:49,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:11:49,698 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:11:49,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:11:49,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:11:49,699 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:11:49,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:11:49,700 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:11:49,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:11:49,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:11:49,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:11:49,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:11:49,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:11:49,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:11:49,701 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:11:49,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:11:49,703 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:11:49,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:11:49,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:11:49,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:11:49,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:11:49,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:11:49,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:11:49,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:11:49,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:11:49,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:11:49,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:11:49,705 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:11:49,705 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:11:49,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:11:49,706 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 -> cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 [2022-07-22 11:11:49,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:11:49,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:11:49,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:11:49,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:11:49,997 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:11:49,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-22 11:11:50,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50114d0f4/248c25d08edd4c098bcf81ac0606223c/FLAG6348e5113 [2022-07-22 11:11:50,539 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:11:50,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-22 11:11:50,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50114d0f4/248c25d08edd4c098bcf81ac0606223c/FLAG6348e5113 [2022-07-22 11:11:50,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50114d0f4/248c25d08edd4c098bcf81ac0606223c [2022-07-22 11:11:50,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:11:50,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:11:50,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:11:50,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:11:50,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:11:50,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:11:50" (1/1) ... [2022-07-22 11:11:50,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574ce65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:50, skipping insertion in model container [2022-07-22 11:11:50,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:11:50" (1/1) ... [2022-07-22 11:11:50,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:11:50,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:11:51,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c[65397,65410] [2022-07-22 11:11:51,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:11:51,321 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:11:51,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c[65397,65410] [2022-07-22 11:11:51,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:11:51,431 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:11:51,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51 WrapperNode [2022-07-22 11:11:51,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:11:51,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:11:51,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:11:51,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:11:51,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,524 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2022-07-22 11:11:51,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:11:51,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:11:51,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:11:51,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:11:51,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:11:51,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:11:51,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:11:51,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:11:51,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (1/1) ... [2022-07-22 11:11:51,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:11:51,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:11:51,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 11:11:51,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 11:11:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:11:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:11:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:11:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:11:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:11:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:11:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:11:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:11:51,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:11:51,924 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:11:51,925 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:11:51,974 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:11:54,752 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-22 11:11:54,767 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-22 11:11:54,767 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:11:54,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:11:54,774 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:11:54,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:11:54 BoogieIcfgContainer [2022-07-22 11:11:54,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:11:54,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:11:54,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:11:54,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:11:54,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:11:50" (1/3) ... [2022-07-22 11:11:54,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2989fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:11:54, skipping insertion in model container [2022-07-22 11:11:54,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:11:51" (2/3) ... [2022-07-22 11:11:54,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2989fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:11:54, skipping insertion in model container [2022-07-22 11:11:54,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:11:54" (3/3) ... [2022-07-22 11:11:54,784 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-07-22 11:11:54,806 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:11:54,807 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:11:54,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:11:54,894 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@63314e59, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ce1986b [2022-07-22 11:11:54,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:11:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:11:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 11:11:54,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:11:54,910 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 11:11:54,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:11:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:11:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-22 11:11:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:11:54,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74018255] [2022-07-22 11:11:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:11:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:11:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:11:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:11:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:11:55,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74018255] [2022-07-22 11:11:55,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74018255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:11:55,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:11:55,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:11:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011469901] [2022-07-22 11:11:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:11:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:11:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:11:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:11:55,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:11:55,594 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 11:11:57,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:11:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:11:57,885 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2022-07-22 11:11:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:11:57,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 11:11:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:11:57,896 INFO L225 Difference]: With dead ends: 255 [2022-07-22 11:11:57,897 INFO L226 Difference]: Without dead ends: 116 [2022-07-22 11:11:57,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:11:57,902 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 7 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:11:57,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 530 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:11:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-22 11:11:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-07-22 11:11:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:11:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-22 11:11:57,938 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-22 11:11:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:11:57,938 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-22 11:11:57,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 11:11:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-22 11:11:57,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 11:11:57,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:11:57,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:11:57,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:11:57,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:11:57,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:11:57,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2022-07-22 11:11:57,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:11:57,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852890024] [2022-07-22 11:11:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:11:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:11:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:11:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 11:11:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:11:58,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852890024] [2022-07-22 11:11:58,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852890024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:11:58,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:11:58,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:11:58,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087469648] [2022-07-22 11:11:58,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:11:58,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:11:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:11:58,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:11:58,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:11:58,275 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:11:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:11:58,324 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2022-07-22 11:11:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:11:58,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-22 11:11:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:11:58,329 INFO L225 Difference]: With dead ends: 320 [2022-07-22 11:11:58,329 INFO L226 Difference]: Without dead ends: 215 [2022-07-22 11:11:58,330 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 11:11:58,331 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 123 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:11:58,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 311 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:11:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-22 11:11:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-07-22 11:11:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4906542056074767) internal successors, (319), 214 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:11:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2022-07-22 11:11:58,347 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2022-07-22 11:11:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:11:58,348 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2022-07-22 11:11:58,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:11:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2022-07-22 11:11:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 11:11:58,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:11:58,350 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] [2022-07-22 11:11:58,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:11:58,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:11:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:11:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2022-07-22 11:11:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:11:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853548200] [2022-07-22 11:11:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:11:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:11:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:11:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 11:11:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:11:58,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853548200] [2022-07-22 11:11:58,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853548200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:11:58,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:11:58,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:11:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080950840] [2022-07-22 11:11:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:11:58,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:11:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:11:58,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:11:58,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:11:58,613 INFO L87 Difference]: Start difference. First operand 215 states and 319 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 11:12:00,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:00,668 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2022-07-22 11:12:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:12:00,669 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 53 [2022-07-22 11:12:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:00,671 INFO L225 Difference]: With dead ends: 420 [2022-07-22 11:12:00,672 INFO L226 Difference]: Without dead ends: 315 [2022-07-22 11:12:00,673 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 11:12:00,674 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 460 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 11:12:00,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 460 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 11:12:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-22 11:12:00,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-07-22 11:12:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.484076433121019) internal successors, (466), 314 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2022-07-22 11:12:00,697 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2022-07-22 11:12:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:00,697 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2022-07-22 11:12:00,697 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 11:12:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2022-07-22 11:12:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-22 11:12:00,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:00,708 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:00,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:12:00,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2022-07-22 11:12:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:00,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609316455] [2022-07-22 11:12:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:12:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:01,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609316455] [2022-07-22 11:12:01,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609316455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:01,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:01,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538654841] [2022-07-22 11:12:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:01,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:01,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:01,018 INFO L87 Difference]: Start difference. First operand 315 states and 466 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 11:12:02,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:02,885 INFO L93 Difference]: Finished difference Result 891 states and 1325 transitions. [2022-07-22 11:12:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:02,886 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 71 [2022-07-22 11:12:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:02,889 INFO L225 Difference]: With dead ends: 891 [2022-07-22 11:12:02,889 INFO L226 Difference]: Without dead ends: 586 [2022-07-22 11:12:02,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:02,892 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:02,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-22 11:12:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-07-22 11:12:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 387. [2022-07-22 11:12:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.5336787564766838) internal successors, (592), 386 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2022-07-22 11:12:02,910 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 71 [2022-07-22 11:12:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:02,911 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2022-07-22 11:12:02,911 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 11:12:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2022-07-22 11:12:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 11:12:02,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:02,913 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:02,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:12:02,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2022-07-22 11:12:02,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:02,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768243508] [2022-07-22 11:12:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:12:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:03,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768243508] [2022-07-22 11:12:03,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768243508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:03,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:03,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261486554] [2022-07-22 11:12:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:03,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:03,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:03,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:03,097 INFO L87 Difference]: Start difference. First operand 387 states and 592 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 11:12:05,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:07,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:07,443 INFO L93 Difference]: Finished difference Result 941 states and 1438 transitions. [2022-07-22 11:12:07,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:07,443 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 72 [2022-07-22 11:12:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:07,446 INFO L225 Difference]: With dead ends: 941 [2022-07-22 11:12:07,446 INFO L226 Difference]: Without dead ends: 564 [2022-07-22 11:12:07,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:07,448 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 91 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:07,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:12:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-07-22 11:12:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 439. [2022-07-22 11:12:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.552511415525114) internal successors, (680), 438 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 680 transitions. [2022-07-22 11:12:07,462 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 680 transitions. Word has length 72 [2022-07-22 11:12:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:07,462 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 680 transitions. [2022-07-22 11:12:07,462 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 11:12:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 680 transitions. [2022-07-22 11:12:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 11:12:07,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:07,465 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:07,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:12:07,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:07,466 INFO L85 PathProgramCache]: Analyzing trace with hash 26233355, now seen corresponding path program 1 times [2022-07-22 11:12:07,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:07,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438819345] [2022-07-22 11:12:07,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:12:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:07,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438819345] [2022-07-22 11:12:07,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438819345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:07,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:07,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941797316] [2022-07-22 11:12:07,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:07,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:07,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:07,653 INFO L87 Difference]: Start difference. First operand 439 states and 680 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 11:12:09,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:09,906 INFO L93 Difference]: Finished difference Result 1139 states and 1753 transitions. [2022-07-22 11:12:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:09,907 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 72 [2022-07-22 11:12:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:09,910 INFO L225 Difference]: With dead ends: 1139 [2022-07-22 11:12:09,910 INFO L226 Difference]: Without dead ends: 710 [2022-07-22 11:12:09,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:09,914 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:09,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:12:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-22 11:12:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 462. [2022-07-22 11:12:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.5704989154013016) internal successors, (724), 461 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 724 transitions. [2022-07-22 11:12:09,930 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 724 transitions. Word has length 72 [2022-07-22 11:12:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:09,931 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 724 transitions. [2022-07-22 11:12:09,932 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 11:12:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 724 transitions. [2022-07-22 11:12:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 11:12:09,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:09,934 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:09,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:12:09,935 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:09,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1848863885, now seen corresponding path program 1 times [2022-07-22 11:12:09,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:09,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961351442] [2022-07-22 11:12:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:09,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:12:10,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:10,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961351442] [2022-07-22 11:12:10,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961351442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:10,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:10,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:10,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661996669] [2022-07-22 11:12:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:10,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:10,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:10,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:10,137 INFO L87 Difference]: Start difference. First operand 462 states and 724 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:12,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:14,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:14,480 INFO L93 Difference]: Finished difference Result 1091 states and 1700 transitions. [2022-07-22 11:12:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-07-22 11:12:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:14,483 INFO L225 Difference]: With dead ends: 1091 [2022-07-22 11:12:14,484 INFO L226 Difference]: Without dead ends: 639 [2022-07-22 11:12:14,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:14,485 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:14,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:12:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-07-22 11:12:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 508. [2022-07-22 11:12:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.581854043392505) internal successors, (802), 507 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 802 transitions. [2022-07-22 11:12:14,498 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 802 transitions. Word has length 92 [2022-07-22 11:12:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:14,498 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 802 transitions. [2022-07-22 11:12:14,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 802 transitions. [2022-07-22 11:12:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 11:12:14,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:14,512 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:14,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:12:14,512 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1552617073, now seen corresponding path program 1 times [2022-07-22 11:12:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:14,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172280265] [2022-07-22 11:12:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 11:12:14,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:14,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172280265] [2022-07-22 11:12:14,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172280265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:14,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:14,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502590125] [2022-07-22 11:12:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:14,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:14,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:14,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:14,706 INFO L87 Difference]: Start difference. First operand 508 states and 802 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 11:12:16,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:18,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:18,977 INFO L93 Difference]: Finished difference Result 1091 states and 1717 transitions. [2022-07-22 11:12:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:18,978 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 92 [2022-07-22 11:12:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:18,981 INFO L225 Difference]: With dead ends: 1091 [2022-07-22 11:12:18,981 INFO L226 Difference]: Without dead ends: 593 [2022-07-22 11:12:18,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:18,982 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 40 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 494 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 11:12:18,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 494 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:12:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-22 11:12:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 548. [2022-07-22 11:12:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5904936014625228) internal successors, (870), 547 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 870 transitions. [2022-07-22 11:12:19,011 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 870 transitions. Word has length 92 [2022-07-22 11:12:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:19,012 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 870 transitions. [2022-07-22 11:12:19,012 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 11:12:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 870 transitions. [2022-07-22 11:12:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 11:12:19,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:19,014 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2022-07-22 11:12:19,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:12:19,014 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1859686006, now seen corresponding path program 1 times [2022-07-22 11:12:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:19,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908241822] [2022-07-22 11:12:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:12:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:19,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908241822] [2022-07-22 11:12:19,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908241822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:19,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:19,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823996541] [2022-07-22 11:12:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:19,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:19,207 INFO L87 Difference]: Start difference. First operand 548 states and 870 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:21,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:21,570 INFO L93 Difference]: Finished difference Result 1282 states and 1998 transitions. [2022-07-22 11:12:21,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:21,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-22 11:12:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:21,574 INFO L225 Difference]: With dead ends: 1282 [2022-07-22 11:12:21,574 INFO L226 Difference]: Without dead ends: 744 [2022-07-22 11:12:21,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:21,575 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:21,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:12:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-22 11:12:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 548. [2022-07-22 11:12:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5795246800731262) internal successors, (864), 547 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 864 transitions. [2022-07-22 11:12:21,591 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 864 transitions. Word has length 93 [2022-07-22 11:12:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:21,592 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 864 transitions. [2022-07-22 11:12:21,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 864 transitions. [2022-07-22 11:12:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:12:21,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:21,594 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:21,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:12:21,594 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 500641909, now seen corresponding path program 2 times [2022-07-22 11:12:21,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:21,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903792791] [2022-07-22 11:12:21,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:21,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:12:21,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:21,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903792791] [2022-07-22 11:12:21,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903792791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:21,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:21,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:21,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199451255] [2022-07-22 11:12:21,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:21,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:21,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:21,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:21,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:21,784 INFO L87 Difference]: Start difference. First operand 548 states and 864 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 11:12:23,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:25,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:26,139 INFO L93 Difference]: Finished difference Result 1279 states and 1983 transitions. [2022-07-22 11:12:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:26,140 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 106 [2022-07-22 11:12:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:26,142 INFO L225 Difference]: With dead ends: 1279 [2022-07-22 11:12:26,142 INFO L226 Difference]: Without dead ends: 741 [2022-07-22 11:12:26,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:26,144 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:26,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:12:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-22 11:12:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 548. [2022-07-22 11:12:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5612431444241317) internal successors, (854), 547 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 854 transitions. [2022-07-22 11:12:26,160 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 854 transitions. Word has length 106 [2022-07-22 11:12:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:26,160 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 854 transitions. [2022-07-22 11:12:26,161 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 11:12:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 854 transitions. [2022-07-22 11:12:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:12:26,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:26,163 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:26,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:12:26,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1117113491, now seen corresponding path program 1 times [2022-07-22 11:12:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:26,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397307591] [2022-07-22 11:12:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:12:26,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:26,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397307591] [2022-07-22 11:12:26,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397307591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:26,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:26,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694766452] [2022-07-22 11:12:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:26,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:26,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:26,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:26,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:26,390 INFO L87 Difference]: Start difference. First operand 548 states and 854 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 11:12:28,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:30,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:30,690 INFO L93 Difference]: Finished difference Result 1209 states and 1869 transitions. [2022-07-22 11:12:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:30,690 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 106 [2022-07-22 11:12:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:30,693 INFO L225 Difference]: With dead ends: 1209 [2022-07-22 11:12:30,693 INFO L226 Difference]: Without dead ends: 671 [2022-07-22 11:12:30,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:30,695 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 97 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:30,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 538 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:12:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-07-22 11:12:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 548. [2022-07-22 11:12:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5575868372943327) internal successors, (852), 547 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 852 transitions. [2022-07-22 11:12:30,708 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 852 transitions. Word has length 106 [2022-07-22 11:12:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:30,708 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 852 transitions. [2022-07-22 11:12:30,708 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 11:12:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 852 transitions. [2022-07-22 11:12:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:12:30,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:30,710 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:30,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:12:30,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1677813269, now seen corresponding path program 1 times [2022-07-22 11:12:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:30,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876705292] [2022-07-22 11:12:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:12:30,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:30,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876705292] [2022-07-22 11:12:30,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876705292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:30,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:30,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288320861] [2022-07-22 11:12:30,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:30,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:30,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:30,896 INFO L87 Difference]: Start difference. First operand 548 states and 852 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 11:12:32,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:34,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:35,152 INFO L93 Difference]: Finished difference Result 1129 states and 1745 transitions. [2022-07-22 11:12:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:35,153 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 106 [2022-07-22 11:12:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:35,155 INFO L225 Difference]: With dead ends: 1129 [2022-07-22 11:12:35,155 INFO L226 Difference]: Without dead ends: 591 [2022-07-22 11:12:35,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:35,158 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 46 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:35,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 492 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:12:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-22 11:12:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 548. [2022-07-22 11:12:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5539305301645339) internal successors, (850), 547 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 850 transitions. [2022-07-22 11:12:35,172 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 850 transitions. Word has length 106 [2022-07-22 11:12:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:35,172 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 850 transitions. [2022-07-22 11:12:35,173 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 11:12:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 850 transitions. [2022-07-22 11:12:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 11:12:35,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:35,174 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:35,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:12:35,175 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash -602992740, now seen corresponding path program 1 times [2022-07-22 11:12:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:35,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779048055] [2022-07-22 11:12:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:12:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:35,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779048055] [2022-07-22 11:12:35,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779048055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:35,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:35,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068621359] [2022-07-22 11:12:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:35,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:35,382 INFO L87 Difference]: Start difference. First operand 548 states and 850 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 11:12:37,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:37,791 INFO L93 Difference]: Finished difference Result 1280 states and 1956 transitions. [2022-07-22 11:12:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:37,792 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 107 [2022-07-22 11:12:37,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:37,795 INFO L225 Difference]: With dead ends: 1280 [2022-07-22 11:12:37,795 INFO L226 Difference]: Without dead ends: 742 [2022-07-22 11:12:37,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:37,797 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 117 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:37,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 290 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-22 11:12:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-07-22 11:12:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 548. [2022-07-22 11:12:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5356489945155394) internal successors, (840), 547 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 840 transitions. [2022-07-22 11:12:37,814 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 840 transitions. Word has length 107 [2022-07-22 11:12:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:37,815 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 840 transitions. [2022-07-22 11:12:37,815 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 11:12:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 840 transitions. [2022-07-22 11:12:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 11:12:37,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:37,817 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:37,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:12:37,817 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1332849040, now seen corresponding path program 1 times [2022-07-22 11:12:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:37,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305107556] [2022-07-22 11:12:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:12:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:38,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305107556] [2022-07-22 11:12:38,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305107556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:38,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:38,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549735723] [2022-07-22 11:12:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:38,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:38,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:38,036 INFO L87 Difference]: Start difference. First operand 548 states and 840 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:40,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:40,362 INFO L93 Difference]: Finished difference Result 1361 states and 2062 transitions. [2022-07-22 11:12:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-22 11:12:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:40,367 INFO L225 Difference]: With dead ends: 1361 [2022-07-22 11:12:40,367 INFO L226 Difference]: Without dead ends: 823 [2022-07-22 11:12:40,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:40,369 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:40,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 266 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:12:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-07-22 11:12:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 662. [2022-07-22 11:12:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5567322239031771) internal successors, (1029), 661 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1029 transitions. [2022-07-22 11:12:40,387 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1029 transitions. Word has length 107 [2022-07-22 11:12:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:40,388 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1029 transitions. [2022-07-22 11:12:40,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1029 transitions. [2022-07-22 11:12:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:12:40,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:40,390 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:40,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:12:40,391 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1015692680, now seen corresponding path program 1 times [2022-07-22 11:12:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:40,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494783402] [2022-07-22 11:12:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:40,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:12:40,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:40,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494783402] [2022-07-22 11:12:40,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494783402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:40,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:40,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696969770] [2022-07-22 11:12:40,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:40,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:40,573 INFO L87 Difference]: Start difference. First operand 662 states and 1029 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:42,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:42,874 INFO L93 Difference]: Finished difference Result 1508 states and 2314 transitions. [2022-07-22 11:12:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-22 11:12:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:42,878 INFO L225 Difference]: With dead ends: 1508 [2022-07-22 11:12:42,878 INFO L226 Difference]: Without dead ends: 856 [2022-07-22 11:12:42,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:42,879 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 115 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:42,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:12:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-07-22 11:12:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 662. [2022-07-22 11:12:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5370650529500756) internal successors, (1016), 661 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1016 transitions. [2022-07-22 11:12:42,899 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1016 transitions. Word has length 108 [2022-07-22 11:12:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:42,899 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1016 transitions. [2022-07-22 11:12:42,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1016 transitions. [2022-07-22 11:12:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:12:42,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:42,902 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:42,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:12:42,902 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:42,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash -805941339, now seen corresponding path program 1 times [2022-07-22 11:12:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:42,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052425349] [2022-07-22 11:12:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:12:43,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:43,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052425349] [2022-07-22 11:12:43,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052425349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:43,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:43,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622227700] [2022-07-22 11:12:43,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:43,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:43,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:43,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:43,089 INFO L87 Difference]: Start difference. First operand 662 states and 1016 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:45,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:47,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:47,383 INFO L93 Difference]: Finished difference Result 1209 states and 1841 transitions. [2022-07-22 11:12:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:47,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-22 11:12:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:47,387 INFO L225 Difference]: With dead ends: 1209 [2022-07-22 11:12:47,387 INFO L226 Difference]: Without dead ends: 785 [2022-07-22 11:12:47,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:47,389 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 89 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:47,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 532 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:12:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-07-22 11:12:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 662. [2022-07-22 11:12:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5340393343419063) internal successors, (1014), 661 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1014 transitions. [2022-07-22 11:12:47,407 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1014 transitions. Word has length 108 [2022-07-22 11:12:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:47,408 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1014 transitions. [2022-07-22 11:12:47,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1014 transitions. [2022-07-22 11:12:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:12:47,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:47,410 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:47,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:12:47,411 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:47,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:47,411 INFO L85 PathProgramCache]: Analyzing trace with hash -82572025, now seen corresponding path program 1 times [2022-07-22 11:12:47,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:47,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431614897] [2022-07-22 11:12:47,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:47,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:12:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:47,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431614897] [2022-07-22 11:12:47,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431614897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:47,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:47,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494506688] [2022-07-22 11:12:47,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:47,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:47,593 INFO L87 Difference]: Start difference. First operand 662 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:49,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:51,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:51,880 INFO L93 Difference]: Finished difference Result 1433 states and 2183 transitions. [2022-07-22 11:12:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:51,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-22 11:12:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:51,884 INFO L225 Difference]: With dead ends: 1433 [2022-07-22 11:12:51,884 INFO L226 Difference]: Without dead ends: 781 [2022-07-22 11:12:51,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:51,885 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 66 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:51,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 528 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:12:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-07-22 11:12:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 692. [2022-07-22 11:12:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 1.539797395079595) internal successors, (1064), 691 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1064 transitions. [2022-07-22 11:12:51,904 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1064 transitions. Word has length 108 [2022-07-22 11:12:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:51,904 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1064 transitions. [2022-07-22 11:12:51,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1064 transitions. [2022-07-22 11:12:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:12:51,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:51,906 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:12:51,907 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 803875412, now seen corresponding path program 1 times [2022-07-22 11:12:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:51,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172950274] [2022-07-22 11:12:51,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:51,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:12:52,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:52,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172950274] [2022-07-22 11:12:52,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172950274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:52,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:52,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:52,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789303485] [2022-07-22 11:12:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:52,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:52,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:52,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:52,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:52,081 INFO L87 Difference]: Start difference. First operand 692 states and 1064 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:54,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:54,357 INFO L93 Difference]: Finished difference Result 1568 states and 2384 transitions. [2022-07-22 11:12:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-22 11:12:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:54,361 INFO L225 Difference]: With dead ends: 1568 [2022-07-22 11:12:54,361 INFO L226 Difference]: Without dead ends: 886 [2022-07-22 11:12:54,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:54,363 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 90 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:54,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:12:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-07-22 11:12:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 731. [2022-07-22 11:12:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5602739726027397) internal successors, (1139), 730 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 11:12:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1139 transitions. [2022-07-22 11:12:54,398 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1139 transitions. Word has length 108 [2022-07-22 11:12:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:54,398 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1139 transitions. [2022-07-22 11:12:54,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1139 transitions. [2022-07-22 11:12:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 11:12:54,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:54,401 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:54,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:12:54,401 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1155633319, now seen corresponding path program 1 times [2022-07-22 11:12:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:54,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306873152] [2022-07-22 11:12:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:54,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:12:54,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:54,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306873152] [2022-07-22 11:12:54,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306873152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:54,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:54,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:54,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77163816] [2022-07-22 11:12:54,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:54,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:54,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:54,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:54,586 INFO L87 Difference]: Start difference. First operand 731 states and 1139 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:56,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:58,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:12:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:12:58,828 INFO L93 Difference]: Finished difference Result 1239 states and 1920 transitions. [2022-07-22 11:12:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:12:58,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-22 11:12:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:12:58,832 INFO L225 Difference]: With dead ends: 1239 [2022-07-22 11:12:58,832 INFO L226 Difference]: Without dead ends: 774 [2022-07-22 11:12:58,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:12:58,834 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 39 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:12:58,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 486 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:12:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-07-22 11:12:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 731. [2022-07-22 11:12:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5575342465753426) internal successors, (1137), 730 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1137 transitions. [2022-07-22 11:12:58,853 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1137 transitions. Word has length 108 [2022-07-22 11:12:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:12:58,854 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1137 transitions. [2022-07-22 11:12:58,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:12:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1137 transitions. [2022-07-22 11:12:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 11:12:58,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:12:58,856 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:12:58,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:12:58,856 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:12:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:12:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 446496737, now seen corresponding path program 1 times [2022-07-22 11:12:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:12:58,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810137146] [2022-07-22 11:12:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:12:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:12:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:12:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:12:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:12:59,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810137146] [2022-07-22 11:12:59,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810137146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:12:59,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:12:59,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:12:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371540113] [2022-07-22 11:12:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:12:59,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:12:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:12:59,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:12:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:12:59,042 INFO L87 Difference]: Start difference. First operand 731 states and 1137 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:01,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:03,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:03,344 INFO L93 Difference]: Finished difference Result 1523 states and 2353 transitions. [2022-07-22 11:13:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-22 11:13:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:03,347 INFO L225 Difference]: With dead ends: 1523 [2022-07-22 11:13:03,347 INFO L226 Difference]: Without dead ends: 802 [2022-07-22 11:13:03,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:13:03,361 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 79 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:03,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 510 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:13:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-22 11:13:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 731. [2022-07-22 11:13:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5547945205479452) internal successors, (1135), 730 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 11:13:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1135 transitions. [2022-07-22 11:13:03,412 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1135 transitions. Word has length 109 [2022-07-22 11:13:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:03,413 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1135 transitions. [2022-07-22 11:13:03,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1135 transitions. [2022-07-22 11:13:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 11:13:03,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:03,415 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1] [2022-07-22 11:13:03,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:13:03,416 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:03,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:03,416 INFO L85 PathProgramCache]: Analyzing trace with hash -585249362, now seen corresponding path program 1 times [2022-07-22 11:13:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:03,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233001719] [2022-07-22 11:13:03,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:03,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:03,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233001719] [2022-07-22 11:13:03,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233001719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:03,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:03,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549123283] [2022-07-22 11:13:03,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:03,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:03,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:03,688 INFO L87 Difference]: Start difference. First operand 731 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:05,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:07,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:08,019 INFO L93 Difference]: Finished difference Result 1260 states and 1943 transitions. [2022-07-22 11:13:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:08,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-22 11:13:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:08,023 INFO L225 Difference]: With dead ends: 1260 [2022-07-22 11:13:08,023 INFO L226 Difference]: Without dead ends: 795 [2022-07-22 11:13:08,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:13:08,025 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 72 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:08,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 502 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 11:13:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-07-22 11:13:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 731. [2022-07-22 11:13:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 1.5520547945205478) internal successors, (1133), 730 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 11:13:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1133 transitions. [2022-07-22 11:13:08,045 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1133 transitions. Word has length 109 [2022-07-22 11:13:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:08,045 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1133 transitions. [2022-07-22 11:13:08,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1133 transitions. [2022-07-22 11:13:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 11:13:08,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:08,048 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:08,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:13:08,048 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 147177277, now seen corresponding path program 1 times [2022-07-22 11:13:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:08,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806989082] [2022-07-22 11:13:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:13:08,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:08,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806989082] [2022-07-22 11:13:08,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806989082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:08,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:08,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:08,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291011390] [2022-07-22 11:13:08,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:08,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:08,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:08,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:08,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:08,237 INFO L87 Difference]: Start difference. First operand 731 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:10,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:10,589 INFO L93 Difference]: Finished difference Result 1601 states and 2438 transitions. [2022-07-22 11:13:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:10,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-22 11:13:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:10,594 INFO L225 Difference]: With dead ends: 1601 [2022-07-22 11:13:10,594 INFO L226 Difference]: Without dead ends: 880 [2022-07-22 11:13:10,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:13:10,596 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 87 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:10,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 266 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 207 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:13:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-22 11:13:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-22 11:13:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5497953615279672) internal successors, (1136), 733 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 11:13:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1136 transitions. [2022-07-22 11:13:10,617 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1136 transitions. Word has length 109 [2022-07-22 11:13:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:10,618 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1136 transitions. [2022-07-22 11:13:10,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1136 transitions. [2022-07-22 11:13:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 11:13:10,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:10,620 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:10,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:13:10,620 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1125768991, now seen corresponding path program 1 times [2022-07-22 11:13:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:10,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359898717] [2022-07-22 11:13:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:10,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:10,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359898717] [2022-07-22 11:13:10,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359898717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:10,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487004409] [2022-07-22 11:13:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:10,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:10,911 INFO L87 Difference]: Start difference. First operand 734 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:12,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:13,144 INFO L93 Difference]: Finished difference Result 1604 states and 2438 transitions. [2022-07-22 11:13:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:13,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-22 11:13:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:13,147 INFO L225 Difference]: With dead ends: 1604 [2022-07-22 11:13:13,147 INFO L226 Difference]: Without dead ends: 880 [2022-07-22 11:13:13,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:13:13,152 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 110 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:13,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 266 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 207 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 11:13:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-22 11:13:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-22 11:13:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.534788540245566) internal successors, (1125), 733 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 11:13:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1125 transitions. [2022-07-22 11:13:13,173 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1125 transitions. Word has length 109 [2022-07-22 11:13:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:13,173 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1125 transitions. [2022-07-22 11:13:13,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1125 transitions. [2022-07-22 11:13:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 11:13:13,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:13,182 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1] [2022-07-22 11:13:13,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 11:13:13,182 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash 94022892, now seen corresponding path program 1 times [2022-07-22 11:13:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:13,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754628416] [2022-07-22 11:13:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:13,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:13,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754628416] [2022-07-22 11:13:13,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754628416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:13,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:13,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246376623] [2022-07-22 11:13:13,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:13,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:13,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:13,352 INFO L87 Difference]: Start difference. First operand 734 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:15,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:17,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:17,529 INFO L93 Difference]: Finished difference Result 1219 states and 1867 transitions. [2022-07-22 11:13:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:17,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-22 11:13:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:17,532 INFO L225 Difference]: With dead ends: 1219 [2022-07-22 11:13:17,532 INFO L226 Difference]: Without dead ends: 752 [2022-07-22 11:13:17,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:13:17,533 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 25 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:17,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 462 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:13:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-22 11:13:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 734. [2022-07-22 11:13:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5320600272851297) internal successors, (1123), 733 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1123 transitions. [2022-07-22 11:13:17,566 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1123 transitions. Word has length 109 [2022-07-22 11:13:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:17,567 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1123 transitions. [2022-07-22 11:13:17,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1123 transitions. [2022-07-22 11:13:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 11:13:17,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:17,569 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] [2022-07-22 11:13:17,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 11:13:17,570 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1469182628, now seen corresponding path program 1 times [2022-07-22 11:13:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:17,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863963343] [2022-07-22 11:13:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 11:13:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:17,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863963343] [2022-07-22 11:13:17,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863963343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:17,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:17,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768007095] [2022-07-22 11:13:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:17,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:17,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:17,737 INFO L87 Difference]: Start difference. First operand 734 states and 1123 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 11:13:19,746 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:20,017 INFO L93 Difference]: Finished difference Result 1604 states and 2412 transitions. [2022-07-22 11:13:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:20,017 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 110 [2022-07-22 11:13:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:20,022 INFO L225 Difference]: With dead ends: 1604 [2022-07-22 11:13:20,022 INFO L226 Difference]: Without dead ends: 880 [2022-07-22 11:13:20,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:13:20,025 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 104 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:20,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 272 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 11:13:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-22 11:13:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-22 11:13:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5170532060027284) internal successors, (1112), 733 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1112 transitions. [2022-07-22 11:13:20,054 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1112 transitions. Word has length 110 [2022-07-22 11:13:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:20,054 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1112 transitions. [2022-07-22 11:13:20,055 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 11:13:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1112 transitions. [2022-07-22 11:13:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 11:13:20,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:20,057 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:20,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 11:13:20,057 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash 797770585, now seen corresponding path program 1 times [2022-07-22 11:13:20,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:20,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671827759] [2022-07-22 11:13:20,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 11:13:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:20,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671827759] [2022-07-22 11:13:20,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671827759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:20,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:20,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:13:20,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601398419] [2022-07-22 11:13:20,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:20,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:13:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:20,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:13:20,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:13:20,238 INFO L87 Difference]: Start difference. First operand 734 states and 1112 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:22,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:24,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:24,494 INFO L93 Difference]: Finished difference Result 1508 states and 2274 transitions. [2022-07-22 11:13:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:13:24,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 110 [2022-07-22 11:13:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:24,497 INFO L225 Difference]: With dead ends: 1508 [2022-07-22 11:13:24,497 INFO L226 Difference]: Without dead ends: 784 [2022-07-22 11:13:24,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:13:24,499 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 41 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:24,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 490 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-22 11:13:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-22 11:13:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 740. [2022-07-22 11:13:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.5128552097428958) internal successors, (1118), 739 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1118 transitions. [2022-07-22 11:13:24,519 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1118 transitions. Word has length 110 [2022-07-22 11:13:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:24,519 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1118 transitions. [2022-07-22 11:13:24,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1118 transitions. [2022-07-22 11:13:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 11:13:24,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:24,522 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] [2022-07-22 11:13:24,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 11:13:24,522 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1886579234, now seen corresponding path program 1 times [2022-07-22 11:13:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:24,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697913716] [2022-07-22 11:13:24,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-22 11:13:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:13:24,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697913716] [2022-07-22 11:13:24,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697913716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:24,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:24,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:13:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425142241] [2022-07-22 11:13:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:24,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:13:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:13:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:13:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:24,711 INFO L87 Difference]: Start difference. First operand 740 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:26,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:26,764 INFO L93 Difference]: Finished difference Result 1472 states and 2231 transitions. [2022-07-22 11:13:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:13:26,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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 110 [2022-07-22 11:13:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:26,766 INFO L225 Difference]: With dead ends: 1472 [2022-07-22 11:13:26,766 INFO L226 Difference]: Without dead ends: 1004 [2022-07-22 11:13:26,767 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 11:13:26,768 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 468 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 11:13:26,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-22 11:13:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-07-22 11:13:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2022-07-22 11:13:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 1.5094715852442673) internal successors, (1514), 1003 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1514 transitions. [2022-07-22 11:13:26,793 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1514 transitions. Word has length 110 [2022-07-22 11:13:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:26,793 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1514 transitions. [2022-07-22 11:13:26,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1514 transitions. [2022-07-22 11:13:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-22 11:13:26,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:26,796 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] [2022-07-22 11:13:26,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 11:13:26,796 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:26,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2022-07-22 11:13:26,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:13:26,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866996204] [2022-07-22 11:13:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:13:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:13:27,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:13:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:13:28,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:13:28,313 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:13:28,314 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:13:28,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 11:13:28,325 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:13:28,329 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:13:28,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:13:28 BoogieIcfgContainer [2022-07-22 11:13:28,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:13:28,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:13:28,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:13:28,479 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:13:28,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:11:54" (3/4) ... [2022-07-22 11:13:28,483 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 11:13:28,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:13:28,484 INFO L158 Benchmark]: Toolchain (without parser) took 97611.86ms. Allocated memory was 96.5MB in the beginning and 362.8MB in the end (delta: 266.3MB). Free memory was 61.1MB in the beginning and 229.6MB in the end (delta: -168.5MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. [2022-07-22 11:13:28,484 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory was 70.0MB in the beginning and 70.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:13:28,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.39ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 55.0MB in the end (delta: 5.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 11:13:28,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.55ms. Allocated memory is still 96.5MB. Free memory was 54.5MB in the beginning and 49.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:13:28,485 INFO L158 Benchmark]: Boogie Preprocessor took 102.31ms. Allocated memory is still 96.5MB. Free memory was 49.8MB in the beginning and 43.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 11:13:28,485 INFO L158 Benchmark]: RCFGBuilder took 3148.17ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 43.5MB in the beginning and 68.2MB in the end (delta: -24.7MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-07-22 11:13:28,485 INFO L158 Benchmark]: TraceAbstraction took 93700.28ms. Allocated memory was 121.6MB in the beginning and 362.8MB in the end (delta: 241.2MB). Free memory was 68.2MB in the beginning and 229.6MB in the end (delta: -161.4MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2022-07-22 11:13:28,486 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 362.8MB. Free memory is still 229.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:13:28,487 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.28ms. Allocated memory is still 96.5MB. Free memory was 70.0MB in the beginning and 70.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.39ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 55.0MB in the end (delta: 5.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.55ms. Allocated memory is still 96.5MB. Free memory was 54.5MB in the beginning and 49.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.31ms. Allocated memory is still 96.5MB. Free memory was 49.8MB in the beginning and 43.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3148.17ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 43.5MB in the beginning and 68.2MB in the end (delta: -24.7MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 93700.28ms. Allocated memory was 121.6MB in the beginning and 362.8MB in the end (delta: 241.2MB). Free memory was 68.2MB in the beginning and 229.6MB in the end (delta: -161.4MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 362.8MB. Free memory is still 229.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: 1665]: 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 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->version=8, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->init_buf={0:-4}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-9:0}, s={-9:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1325] COND FALSE !(ret <= 0) [L1330] s->state = 4384 [L1331] s->init_num = 0 [L1332] EXPR s->bbio [L1332] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->bbio={0:5}, s->wbio={0:-3}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1332] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=11, s={-9:0}, s={-9:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1340] ret = __VERIFIER_nondet_int() [L1341] COND TRUE blastFlag == 1 [L1342] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1346] COND FALSE !(ret <= 0) [L1351] s->hit VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1356] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967353, (s->s3)->tmp.new_cipher={-7:0}, blastFlag=2, init=1, ret=1, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=19, s={-9:0}, s={-9:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967344, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-9:0}, s={-9:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1665] reach_error() VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-9:0}, s={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 93.5s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 85.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 2305 SdHoareTripleChecker+Valid, 84.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2305 mSDsluCounter, 10866 SdHoareTripleChecker+Invalid, 82.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6243 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4772 IncrementalHoareTripleChecker+Invalid, 5352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 4623 mSDtfsCounter, 4772 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1004occurred in iteration=27, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 2898 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2666 NumberOfCodeBlocks, 2666 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2527 ConstructedInterpolants, 0 QuantifiedInterpolants, 6161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 2634/2634 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 11:13:28,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:13:30,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:13:30,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:13:30,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:13:30,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:13:30,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:13:30,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:13:30,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:13:30,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:13:30,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:13:30,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:13:30,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:13:30,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:13:30,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:13:30,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:13:30,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:13:30,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:13:30,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:13:30,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:13:30,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:13:30,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:13:30,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:13:30,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:13:30,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:13:30,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:13:30,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:13:30,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:13:30,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:13:30,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:13:30,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:13:30,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:13:30,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:13:30,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:13:30,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:13:30,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:13:30,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:13:30,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:13:30,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:13:30,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:13:30,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:13:30,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:13:30,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:13:30,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 11:13:30,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:13:30,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:13:30,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:13:30,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:13:30,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:13:30,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:13:30,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:13:30,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:13:30,652 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:13:30,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:13:30,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:13:30,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:13:30,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:13:30,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:13:30,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:13:30,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:13:30,662 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 11:13:30,662 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 11:13:30,663 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 11:13:30,663 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:13:30,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:13:30,663 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:13:30,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:13:30,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:13:30,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:13:30,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:13:30,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:13:30,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:13:30,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:13:30,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:13:30,666 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 11:13:30,666 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 11:13:30,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:13:30,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:13:30,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:13:30,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 11:13:30,668 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 -> cb7820adb8b2f38a9324aaaef54a50c7e172a86afb91c31d3452a676649fd690 [2022-07-22 11:13:31,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:13:31,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:13:31,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:13:31,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:13:31,050 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:13:31,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-22 11:13:31,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e30ef9a/72587a588e6f4453821ae066d2bdcfbe/FLAGb496ab376 [2022-07-22 11:13:31,764 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:13:31,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-22 11:13:31,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e30ef9a/72587a588e6f4453821ae066d2bdcfbe/FLAGb496ab376 [2022-07-22 11:13:32,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e30ef9a/72587a588e6f4453821ae066d2bdcfbe [2022-07-22 11:13:32,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:13:32,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:13:32,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:13:32,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:13:32,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:13:32,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:32,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d95dbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32, skipping insertion in model container [2022-07-22 11:13:32,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:32,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:13:32,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:13:32,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c[65397,65410] [2022-07-22 11:13:32,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:13:32,618 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 11:13:32,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:13:32,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c[65397,65410] [2022-07-22 11:13:32,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:13:32,750 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:13:32,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c[65397,65410] [2022-07-22 11:13:32,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:13:32,888 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:13:32,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32 WrapperNode [2022-07-22 11:13:32,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:13:32,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:13:32,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:13:32,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:13:32,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:32,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:32,983 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 689 [2022-07-22 11:13:32,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:13:32,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:13:32,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:13:32,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:13:32,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:32,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:33,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:33,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:33,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:33,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:33,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:33,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:13:33,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:13:33,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:13:33,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:13:33,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (1/1) ... [2022-07-22 11:13:33,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:13:33,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:13:33,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 11:13:33,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 11:13:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:13:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 11:13:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:13:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 11:13:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:13:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:13:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:13:33,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:13:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 11:13:33,305 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:13:33,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:13:33,336 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:13:40,870 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-22 11:13:40,871 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-22 11:13:40,871 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:13:40,876 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:13:40,877 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:13:40,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:13:40 BoogieIcfgContainer [2022-07-22 11:13:40,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:13:40,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:13:40,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:13:40,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:13:40,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:13:32" (1/3) ... [2022-07-22 11:13:40,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c0420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:13:40, skipping insertion in model container [2022-07-22 11:13:40,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:13:32" (2/3) ... [2022-07-22 11:13:40,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3c0420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:13:40, skipping insertion in model container [2022-07-22 11:13:40,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:13:40" (3/3) ... [2022-07-22 11:13:40,886 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-07-22 11:13:40,909 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:13:40,909 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:13:40,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:13:40,971 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@232ada7a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1aa173a2 [2022-07-22 11:13:40,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:13:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 11:13:40,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:40,986 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 11:13:40,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-22 11:13:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:13:41,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222547545] [2022-07-22 11:13:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:41,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:13:41,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:13:41,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:13:41,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 11:13:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:41,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:13:41,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:13:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:13:42,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:13:42,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:13:42,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222547545] [2022-07-22 11:13:42,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222547545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:42,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:42,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:13:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356270131] [2022-07-22 11:13:42,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:13:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:13:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:13:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:42,049 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 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 11:13:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:42,186 INFO L93 Difference]: Finished difference Result 368 states and 621 transitions. [2022-07-22 11:13:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:13:42,188 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 11:13:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:42,202 INFO L225 Difference]: With dead ends: 368 [2022-07-22 11:13:42,202 INFO L226 Difference]: Without dead ends: 212 [2022-07-22 11:13:42,206 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 11:13:42,213 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 179 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:13:42,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 401 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:13:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-22 11:13:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-07-22 11:13:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.4976303317535544) internal successors, (316), 211 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 316 transitions. [2022-07-22 11:13:42,271 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 316 transitions. Word has length 24 [2022-07-22 11:13:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:42,271 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 316 transitions. [2022-07-22 11:13:42,272 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 11:13:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 316 transitions. [2022-07-22 11:13:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 11:13:42,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:42,274 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 11:13:42,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 11:13:42,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:13:42,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:42,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1509035189, now seen corresponding path program 1 times [2022-07-22 11:13:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:13:42,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564885914] [2022-07-22 11:13:42,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:42,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:13:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:13:42,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:13:42,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 11:13:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:43,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:13:43,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:13:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:13:43,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:13:43,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:13:43,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564885914] [2022-07-22 11:13:43,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564885914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:43,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:43,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:13:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062151740] [2022-07-22 11:13:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:43,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:13:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:13:43,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:13:43,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:43,494 INFO L87 Difference]: Start difference. First operand 212 states and 316 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 11:13:45,530 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 11:13:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:45,635 INFO L93 Difference]: Finished difference Result 417 states and 627 transitions. [2022-07-22 11:13:45,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:13:45,635 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 11:13:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:45,637 INFO L225 Difference]: With dead ends: 417 [2022-07-22 11:13:45,637 INFO L226 Difference]: Without dead ends: 312 [2022-07-22 11:13:45,638 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 11:13:45,639 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 460 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 11:13:45,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 460 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 11:13:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-22 11:13:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-22 11:13:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.4887459807073955) internal successors, (463), 311 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2022-07-22 11:13:45,655 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 39 [2022-07-22 11:13:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:45,655 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2022-07-22 11:13:45,655 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 11:13:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2022-07-22 11:13:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:13:45,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:45,658 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 11:13:45,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 11:13:45,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:13:45,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:45,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1699665034, now seen corresponding path program 1 times [2022-07-22 11:13:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:13:45,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948596631] [2022-07-22 11:13:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:45,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:13:45,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:13:45,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:13:45,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 11:13:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:46,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:13:46,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:13:46,848 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 11:13:46,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:13:46,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:13:46,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948596631] [2022-07-22 11:13:46,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948596631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:46,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:46,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:13:46,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248966227] [2022-07-22 11:13:46,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:46,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:13:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:13:46,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:13:46,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:46,850 INFO L87 Difference]: Start difference. First operand 312 states and 463 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 11:13:48,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:48,967 INFO L93 Difference]: Finished difference Result 619 states and 924 transitions. [2022-07-22 11:13:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:13:48,968 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 11:13:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:48,970 INFO L225 Difference]: With dead ends: 619 [2022-07-22 11:13:48,970 INFO L226 Difference]: Without dead ends: 414 [2022-07-22 11:13:48,971 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 11:13:48,972 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 468 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 11:13:48,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 11:13:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-22 11:13:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-22 11:13:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4842615012106537) internal successors, (613), 413 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2022-07-22 11:13:49,003 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2022-07-22 11:13:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:49,003 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2022-07-22 11:13:49,004 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 11:13:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2022-07-22 11:13:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 11:13:49,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:49,007 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 11:13:49,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:13:49,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:13:49,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1132708561, now seen corresponding path program 1 times [2022-07-22 11:13:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:13:49,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182364304] [2022-07-22 11:13:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:49,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:13:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:13:49,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:13:49,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 11:13:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:50,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:13:50,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:13:50,315 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 11:13:50,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:13:50,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:13:50,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182364304] [2022-07-22 11:13:50,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182364304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:13:50,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:13:50,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:13:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584514079] [2022-07-22 11:13:50,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:13:50,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:13:50,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:13:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:13:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:13:50,317 INFO L87 Difference]: Start difference. First operand 414 states and 613 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 11:13:52,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 11:13:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:13:52,436 INFO L93 Difference]: Finished difference Result 822 states and 1223 transitions. [2022-07-22 11:13:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:13:52,437 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 11:13:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:13:52,439 INFO L225 Difference]: With dead ends: 822 [2022-07-22 11:13:52,439 INFO L226 Difference]: Without dead ends: 515 [2022-07-22 11:13:52,441 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 11:13:52,442 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 126 mSDsluCounter, 156 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 11:13:52,442 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 11:13:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-22 11:13:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-07-22 11:13:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.482490272373541) internal successors, (762), 514 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:13:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2022-07-22 11:13:52,457 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2022-07-22 11:13:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:13:52,457 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2022-07-22 11:13:52,457 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 11:13:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2022-07-22 11:13:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 11:13:52,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:13:52,463 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 11:13:52,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:13:52,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 11:13:52,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:13:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:13:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1093818034, now seen corresponding path program 1 times [2022-07-22 11:13:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:13:52,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963199135] [2022-07-22 11:13:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:13:52,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:13:52,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:13:52,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 11:13:52,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 11:13:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:13:54,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 11:13:54,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:13:55,808 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-22 11:13:55,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1482 treesize of output 1090 [2022-07-22 11:14:10,270 WARN L233 SmtUtils]: Spent 14.37s on a formula simplification. DAG size of input: 205 DAG size of output: 93 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 11:14:10,271 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-22 11:14:10,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 4790 treesize of output 4750 [2022-07-22 11:14:10,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4345 treesize of output 3031 [2022-07-22 11:14:10,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 11:14:10,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2466 treesize of output 1710 [2022-07-22 11:14:11,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 11:14:11,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 968 treesize of output 891 [2022-07-22 11:14:11,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:12,709 INFO L244 Elim1Store]: Index analysis took 732 ms [2022-07-22 11:14:14,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 87 [2022-07-22 11:14:14,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:14,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:15,313 INFO L244 Elim1Store]: Index analysis took 721 ms [2022-07-22 11:14:16,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-22 11:14:16,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:16,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:14:17,215 INFO L244 Elim1Store]: Index analysis took 509 ms [2022-07-22 11:14:17,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-22 11:14:18,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 371 [2022-07-22 11:14:18,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 123 [2022-07-22 11:14:19,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 115