./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 35987657 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-?-3598765 [2022-07-20 22:33:36,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:33:36,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:33:36,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:33:36,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:33:36,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:33:36,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:33:36,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:33:36,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:33:36,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:33:36,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:33:36,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:33:36,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:33:36,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:33:36,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:33:36,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:33:36,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:33:36,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:33:36,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:33:36,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:33:36,841 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:33:36,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:33:36,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:33:36,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:33:36,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:33:36,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:33:36,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:33:36,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:33:36,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:33:36,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:33:36,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:33:36,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:33:36,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:33:36,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:33:36,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:33:36,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:33:36,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:33:36,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:33:36,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:33:36,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:33:36,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:33:36,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:33:36,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:33:36,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:33:36,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:33:36,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:33:36,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:33:36,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:33:36,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:33:36,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:33:36,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:33:36,895 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:33:36,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:33:36,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:33:36,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:33:36,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:33:36,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:33:36,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:33:36,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:33:36,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:33:36,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:33:36,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:33:36,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:33:36,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:33:36,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:33:36,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:33:36,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:33:36,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:33:36,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:33:36,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:33:36,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:33:36,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:33:36,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:33:36,900 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:33:36,900 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:33:36,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:33:36,900 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-20 22:33:37,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:33:37,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:33:37,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:33:37,245 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:33:37,246 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:33:37,247 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-20 22:33:37,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5935d6bb1/bedd056f009042f38907895321fe3331/FLAG56cc70c45 [2022-07-20 22:33:37,821 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:33:37,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-20 22:33:37,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5935d6bb1/bedd056f009042f38907895321fe3331/FLAG56cc70c45 [2022-07-20 22:33:38,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5935d6bb1/bedd056f009042f38907895321fe3331 [2022-07-20 22:33:38,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:33:38,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:33:38,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:33:38,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:33:38,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:33:38,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cea69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38, skipping insertion in model container [2022-07-20 22:33:38,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:33:38,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:33:38,510 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-20 22:33:38,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:33:38,545 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:33:38,625 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-20 22:33:38,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:33:38,653 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:33:38,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38 WrapperNode [2022-07-20 22:33:38,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:33:38,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:33:38,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:33:38,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:33:38,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,744 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2022-07-20 22:33:38,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:33:38,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:33:38,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:33:38,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:33:38,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:33:38,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:33:38,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:33:38,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:33:38,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (1/1) ... [2022-07-20 22:33:38,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:33:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:33:38,888 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-20 22:33:38,902 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-20 22:33:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:33:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 22:33:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:33:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:33:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 22:33:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:33:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:33:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:33:38,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:33:39,093 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:33:39,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:33:39,114 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:33:41,998 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-20 22:33:41,999 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-20 22:33:41,999 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:33:42,005 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:33:42,005 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 22:33:42,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:33:42 BoogieIcfgContainer [2022-07-20 22:33:42,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:33:42,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:33:42,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:33:42,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:33:42,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:33:38" (1/3) ... [2022-07-20 22:33:42,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf85324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:33:42, skipping insertion in model container [2022-07-20 22:33:42,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:33:38" (2/3) ... [2022-07-20 22:33:42,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf85324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:33:42, skipping insertion in model container [2022-07-20 22:33:42,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:33:42" (3/3) ... [2022-07-20 22:33:42,014 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-07-20 22:33:42,025 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:33:42,025 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:33:42,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:33:42,071 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@7eccab53, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79d2719f [2022-07-20 22:33:42,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:33:42,075 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-20 22:33:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:33:42,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:33:42,081 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-20 22:33:42,082 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:33:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:33:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-20 22:33:42,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:33:42,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020933059] [2022-07-20 22:33:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:33:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:33:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:33:42,656 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-20 22:33:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:33:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020933059] [2022-07-20 22:33:42,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020933059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:33:42,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:33:42,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:33:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089622325] [2022-07-20 22:33:42,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:33:42,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:33:42,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:33:42,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:33:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:33:42,692 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-20 22:33:44,722 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-20 22:33:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:33:44,986 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2022-07-20 22:33:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:33:44,989 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-20 22:33:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:33:44,995 INFO L225 Difference]: With dead ends: 255 [2022-07-20 22:33:44,996 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 22:33:44,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:33:45,001 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-20 22:33:45,002 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-20 22:33:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 22:33:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-07-20 22:33:45,051 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-20 22:33:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-20 22:33:45,059 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-20 22:33:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:33:45,060 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-20 22:33:45,060 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-20 22:33:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-20 22:33:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 22:33:45,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:33:45,064 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-20 22:33:45,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:33:45,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:33:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:33:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2022-07-20 22:33:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:33:45,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022155037] [2022-07-20 22:33:45,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:33:45,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:33:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:33:45,357 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-20 22:33:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:33:45,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022155037] [2022-07-20 22:33:45,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022155037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:33:45,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:33:45,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:33:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237494158] [2022-07-20 22:33:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:33:45,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:33:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:33:45,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:33:45,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:33:45,362 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-20 22:33:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:33:45,403 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2022-07-20 22:33:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:33:45,403 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-20 22:33:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:33:45,408 INFO L225 Difference]: With dead ends: 320 [2022-07-20 22:33:45,409 INFO L226 Difference]: Without dead ends: 215 [2022-07-20 22:33:45,411 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-20 22:33:45,415 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-20 22:33:45,416 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-20 22:33:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-20 22:33:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-07-20 22:33:45,437 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-20 22:33:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2022-07-20 22:33:45,441 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2022-07-20 22:33:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:33:45,441 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2022-07-20 22:33:45,442 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-20 22:33:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2022-07-20 22:33:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 22:33:45,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:33:45,449 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-20 22:33:45,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:33:45,452 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:33:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:33:45,453 INFO L85 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2022-07-20 22:33:45,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:33:45,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770136604] [2022-07-20 22:33:45,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:33:45,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:33:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:33:45,724 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-20 22:33:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:33:45,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770136604] [2022-07-20 22:33:45,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770136604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:33:45,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:33:45,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:33:45,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007576497] [2022-07-20 22:33:45,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:33:45,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:33:45,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:33:45,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:33:45,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:33:45,734 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-20 22:33:47,742 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-20 22:33:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:33:47,809 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2022-07-20 22:33:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:33:47,811 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-20 22:33:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:33:47,813 INFO L225 Difference]: With dead ends: 420 [2022-07-20 22:33:47,813 INFO L226 Difference]: Without dead ends: 315 [2022-07-20 22:33:47,813 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-20 22:33:47,814 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:33:47,815 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-20 22:33:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-20 22:33:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-07-20 22:33:47,828 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-20 22:33:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2022-07-20 22:33:47,829 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2022-07-20 22:33:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:33:47,829 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2022-07-20 22:33:47,830 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-20 22:33:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2022-07-20 22:33:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 22:33:47,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:33:47,831 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-20 22:33:47,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 22:33:47,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:33:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:33:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2022-07-20 22:33:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:33:47,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406334054] [2022-07-20 22:33:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:33:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:33:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:33:48,081 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-20 22:33:48,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:33:48,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406334054] [2022-07-20 22:33:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406334054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:33:48,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:33:48,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:33:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085668016] [2022-07-20 22:33:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:33:48,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:33:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:33:48,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:33:48,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:33:48,084 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-20 22:33:50,106 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-20 22:33:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:33:50,445 INFO L93 Difference]: Finished difference Result 891 states and 1325 transitions. [2022-07-20 22:33:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:33:50,446 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-20 22:33:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:33:50,449 INFO L225 Difference]: With dead ends: 891 [2022-07-20 22:33:50,449 INFO L226 Difference]: Without dead ends: 586 [2022-07-20 22:33:50,450 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-20 22:33:50,451 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:33:50,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 22:33:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-07-20 22:33:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 387. [2022-07-20 22:33:50,471 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-20 22:33:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2022-07-20 22:33:50,476 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 71 [2022-07-20 22:33:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:33:50,476 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2022-07-20 22:33:50,476 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-20 22:33:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2022-07-20 22:33:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-20 22:33:50,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:33:50,478 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-20 22:33:50,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 22:33:50,479 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:33:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:33:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2022-07-20 22:33:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:33:50,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470621385] [2022-07-20 22:33:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:33:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:33:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:33:50,659 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-20 22:33:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:33:50,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470621385] [2022-07-20 22:33:50,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470621385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:33:50,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:33:50,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:33:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633107534] [2022-07-20 22:33:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:33:50,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:33:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:33:50,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:33:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:33:50,662 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-20 22:33:52,671 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-20 22:33:54,691 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-20 22:33:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:33:55,024 INFO L93 Difference]: Finished difference Result 941 states and 1438 transitions. [2022-07-20 22:33:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:33:55,025 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-20 22:33:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:33:55,029 INFO L225 Difference]: With dead ends: 941 [2022-07-20 22:33:55,029 INFO L226 Difference]: Without dead ends: 564 [2022-07-20 22:33:55,029 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-20 22:33:55,030 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-20 22:33:55,030 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-20 22:33:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-07-20 22:33:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 439. [2022-07-20 22:33:55,047 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-20 22:33:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 680 transitions. [2022-07-20 22:33:55,052 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 680 transitions. Word has length 72 [2022-07-20 22:33:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:33:55,052 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 680 transitions. [2022-07-20 22:33:55,052 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-20 22:33:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 680 transitions. [2022-07-20 22:33:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-20 22:33:55,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:33:55,054 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-20 22:33:55,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 22:33:55,055 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:33:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:33:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash 26233355, now seen corresponding path program 1 times [2022-07-20 22:33:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:33:55,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325450032] [2022-07-20 22:33:55,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:33:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:33:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:33:55,288 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-20 22:33:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:33:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325450032] [2022-07-20 22:33:55,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325450032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:33:55,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:33:55,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:33:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428604484] [2022-07-20 22:33:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:33:55,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:33:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:33:55,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:33:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:33:55,292 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-20 22:33:57,301 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-20 22:33:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:33:57,620 INFO L93 Difference]: Finished difference Result 1139 states and 1753 transitions. [2022-07-20 22:33:57,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:33:57,620 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-20 22:33:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:33:57,623 INFO L225 Difference]: With dead ends: 1139 [2022-07-20 22:33:57,624 INFO L226 Difference]: Without dead ends: 710 [2022-07-20 22:33:57,624 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-20 22:33:57,625 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 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-20 22:33:57,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-20 22:33:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-20 22:33:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 462. [2022-07-20 22:33:57,641 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-20 22:33:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 724 transitions. [2022-07-20 22:33:57,643 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 724 transitions. Word has length 72 [2022-07-20 22:33:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:33:57,644 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 724 transitions. [2022-07-20 22:33:57,644 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-20 22:33:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 724 transitions. [2022-07-20 22:33:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-20 22:33:57,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:33:57,646 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-20 22:33:57,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 22:33:57,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:33:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:33:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1848863885, now seen corresponding path program 1 times [2022-07-20 22:33:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:33:57,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212443744] [2022-07-20 22:33:57,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:33:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:33:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:33:57,966 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-20 22:33:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:33:57,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212443744] [2022-07-20 22:33:57,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212443744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:33:57,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:33:57,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:33:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690571748] [2022-07-20 22:33:57,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:33:57,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:33:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:33:57,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:33:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:33:57,969 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-20 22:33:59,978 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-20 22:34:02,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:34:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:02,332 INFO L93 Difference]: Finished difference Result 1091 states and 1700 transitions. [2022-07-20 22:34:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:02,335 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-20 22:34:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:02,338 INFO L225 Difference]: With dead ends: 1091 [2022-07-20 22:34:02,338 INFO L226 Difference]: Without dead ends: 639 [2022-07-20 22:34:02,339 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-20 22:34:02,340 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-20 22:34:02,341 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-20 22:34:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-07-20 22:34:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 508. [2022-07-20 22:34:02,357 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-20 22:34:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 802 transitions. [2022-07-20 22:34:02,359 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 802 transitions. Word has length 92 [2022-07-20 22:34:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:02,359 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 802 transitions. [2022-07-20 22:34:02,359 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-20 22:34:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 802 transitions. [2022-07-20 22:34:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-20 22:34:02,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:02,365 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-20 22:34:02,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 22:34:02,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1552617073, now seen corresponding path program 1 times [2022-07-20 22:34:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:02,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885442298] [2022-07-20 22:34:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:02,546 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-20 22:34:02,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885442298] [2022-07-20 22:34:02,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885442298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:02,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:02,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865471066] [2022-07-20 22:34:02,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:02,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:02,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:02,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:02,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:02,549 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-20 22:34:04,557 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-20 22:34:06,573 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-20 22:34:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:06,809 INFO L93 Difference]: Finished difference Result 1091 states and 1717 transitions. [2022-07-20 22:34:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:06,810 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-20 22:34:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:06,813 INFO L225 Difference]: With dead ends: 1091 [2022-07-20 22:34:06,813 INFO L226 Difference]: Without dead ends: 593 [2022-07-20 22:34:06,814 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-20 22:34:06,815 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-20 22:34:06,815 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-20 22:34:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-20 22:34:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 548. [2022-07-20 22:34:06,827 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-20 22:34:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 870 transitions. [2022-07-20 22:34:06,829 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 870 transitions. Word has length 92 [2022-07-20 22:34:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:06,830 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 870 transitions. [2022-07-20 22:34:06,830 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-20 22:34:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 870 transitions. [2022-07-20 22:34:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-20 22:34:06,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:06,831 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-20 22:34:06,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 22:34:06,832 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1859686006, now seen corresponding path program 1 times [2022-07-20 22:34:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:06,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321010113] [2022-07-20 22:34:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:07,022 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-20 22:34:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:07,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321010113] [2022-07-20 22:34:07,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321010113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:07,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:07,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783000883] [2022-07-20 22:34:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:07,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:07,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:07,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:07,029 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-20 22:34:09,039 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-20 22:34:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:09,314 INFO L93 Difference]: Finished difference Result 1282 states and 1998 transitions. [2022-07-20 22:34:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:09,314 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-20 22:34:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:09,317 INFO L225 Difference]: With dead ends: 1282 [2022-07-20 22:34:09,317 INFO L226 Difference]: Without dead ends: 744 [2022-07-20 22:34:09,318 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-20 22:34:09,319 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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-20 22:34:09,319 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-20 22:34:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-20 22:34:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 548. [2022-07-20 22:34:09,333 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-20 22:34:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 864 transitions. [2022-07-20 22:34:09,334 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 864 transitions. Word has length 93 [2022-07-20 22:34:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:09,335 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 864 transitions. [2022-07-20 22:34:09,335 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-20 22:34:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 864 transitions. [2022-07-20 22:34:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 22:34:09,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:09,337 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-20 22:34:09,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 22:34:09,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:09,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash 500641909, now seen corresponding path program 2 times [2022-07-20 22:34:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:09,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980680235] [2022-07-20 22:34:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:09,519 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-20 22:34:09,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:09,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980680235] [2022-07-20 22:34:09,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980680235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:09,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:09,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003743438] [2022-07-20 22:34:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:09,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:09,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:09,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:09,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:09,523 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-20 22:34:11,535 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-20 22:34:13,551 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-20 22:34:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:13,847 INFO L93 Difference]: Finished difference Result 1279 states and 1983 transitions. [2022-07-20 22:34:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:13,848 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-20 22:34:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:13,851 INFO L225 Difference]: With dead ends: 1279 [2022-07-20 22:34:13,851 INFO L226 Difference]: Without dead ends: 741 [2022-07-20 22:34:13,852 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-20 22:34:13,852 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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-20 22:34:13,852 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-20 22:34:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-20 22:34:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 548. [2022-07-20 22:34:13,866 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-20 22:34:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 854 transitions. [2022-07-20 22:34:13,868 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 854 transitions. Word has length 106 [2022-07-20 22:34:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:13,868 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 854 transitions. [2022-07-20 22:34:13,868 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-20 22:34:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 854 transitions. [2022-07-20 22:34:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 22:34:13,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:13,870 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-20 22:34:13,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 22:34:13,870 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1117113491, now seen corresponding path program 1 times [2022-07-20 22:34:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:13,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807497913] [2022-07-20 22:34:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:14,055 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-20 22:34:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807497913] [2022-07-20 22:34:14,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807497913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:14,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:14,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199264012] [2022-07-20 22:34:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:14,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:14,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:14,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:14,058 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-20 22:34:16,067 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-20 22:34:18,085 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-20 22:34:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:18,378 INFO L93 Difference]: Finished difference Result 1209 states and 1869 transitions. [2022-07-20 22:34:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:18,379 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-20 22:34:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:18,381 INFO L225 Difference]: With dead ends: 1209 [2022-07-20 22:34:18,381 INFO L226 Difference]: Without dead ends: 671 [2022-07-20 22:34:18,382 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-20 22:34:18,382 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-20 22:34:18,383 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-20 22:34:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-07-20 22:34:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 548. [2022-07-20 22:34:18,402 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-20 22:34:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 852 transitions. [2022-07-20 22:34:18,404 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 852 transitions. Word has length 106 [2022-07-20 22:34:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:18,405 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 852 transitions. [2022-07-20 22:34:18,405 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-20 22:34:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 852 transitions. [2022-07-20 22:34:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 22:34:18,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:18,407 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-20 22:34:18,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 22:34:18,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:18,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:18,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1677813269, now seen corresponding path program 1 times [2022-07-20 22:34:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:18,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980514663] [2022-07-20 22:34:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:18,601 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-20 22:34:18,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:18,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980514663] [2022-07-20 22:34:18,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980514663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:18,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:18,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150446880] [2022-07-20 22:34:18,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:18,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:18,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:18,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:18,604 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-20 22:34:20,614 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-20 22:34:22,636 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-20 22:34:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:22,860 INFO L93 Difference]: Finished difference Result 1129 states and 1745 transitions. [2022-07-20 22:34:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:22,860 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-20 22:34:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:22,862 INFO L225 Difference]: With dead ends: 1129 [2022-07-20 22:34:22,862 INFO L226 Difference]: Without dead ends: 591 [2022-07-20 22:34:22,863 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-20 22:34:22,864 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-20 22:34:22,864 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-20 22:34:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-20 22:34:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 548. [2022-07-20 22:34:22,876 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-20 22:34:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 850 transitions. [2022-07-20 22:34:22,878 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 850 transitions. Word has length 106 [2022-07-20 22:34:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:22,878 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 850 transitions. [2022-07-20 22:34:22,878 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-20 22:34:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 850 transitions. [2022-07-20 22:34:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 22:34:22,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:22,880 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-20 22:34:22,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 22:34:22,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -602992740, now seen corresponding path program 1 times [2022-07-20 22:34:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:22,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426468999] [2022-07-20 22:34:22,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:23,096 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-20 22:34:23,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:23,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426468999] [2022-07-20 22:34:23,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426468999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:23,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:23,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163239042] [2022-07-20 22:34:23,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:23,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:23,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:23,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:23,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:23,099 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-20 22:34:25,108 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-20 22:34:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:25,402 INFO L93 Difference]: Finished difference Result 1280 states and 1956 transitions. [2022-07-20 22:34:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:25,403 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-20 22:34:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:25,406 INFO L225 Difference]: With dead ends: 1280 [2022-07-20 22:34:25,406 INFO L226 Difference]: Without dead ends: 742 [2022-07-20 22:34:25,407 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-20 22:34:25,407 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 117 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:34:25,408 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.3s Time] [2022-07-20 22:34:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-07-20 22:34:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 548. [2022-07-20 22:34:25,446 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-20 22:34:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 840 transitions. [2022-07-20 22:34:25,464 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 840 transitions. Word has length 107 [2022-07-20 22:34:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:25,465 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 840 transitions. [2022-07-20 22:34:25,465 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-20 22:34:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 840 transitions. [2022-07-20 22:34:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 22:34:25,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:25,467 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-20 22:34:25,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 22:34:25,467 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1332849040, now seen corresponding path program 1 times [2022-07-20 22:34:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:25,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123576371] [2022-07-20 22:34:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:25,760 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-20 22:34:25,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:25,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123576371] [2022-07-20 22:34:25,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123576371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:25,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:25,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:25,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610315175] [2022-07-20 22:34:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:25,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:25,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:25,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:25,762 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-20 22:34:27,772 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-20 22:34:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:28,073 INFO L93 Difference]: Finished difference Result 1361 states and 2062 transitions. [2022-07-20 22:34:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:28,074 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-20 22:34:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:28,077 INFO L225 Difference]: With dead ends: 1361 [2022-07-20 22:34:28,077 INFO L226 Difference]: Without dead ends: 823 [2022-07-20 22:34:28,078 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-20 22:34:28,078 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-20 22:34:28,079 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-20 22:34:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-07-20 22:34:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 662. [2022-07-20 22:34:28,094 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-20 22:34:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1029 transitions. [2022-07-20 22:34:28,095 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1029 transitions. Word has length 107 [2022-07-20 22:34:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:28,096 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1029 transitions. [2022-07-20 22:34:28,096 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-20 22:34:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1029 transitions. [2022-07-20 22:34:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 22:34:28,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:28,098 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-20 22:34:28,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 22:34:28,098 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1015692680, now seen corresponding path program 1 times [2022-07-20 22:34:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:28,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780873379] [2022-07-20 22:34:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:28,248 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-20 22:34:28,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:28,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780873379] [2022-07-20 22:34:28,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780873379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:28,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:28,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:28,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495436416] [2022-07-20 22:34:28,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:28,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:28,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:28,250 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-20 22:34:30,260 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-20 22:34:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:30,541 INFO L93 Difference]: Finished difference Result 1508 states and 2314 transitions. [2022-07-20 22:34:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:30,541 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-20 22:34:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:30,544 INFO L225 Difference]: With dead ends: 1508 [2022-07-20 22:34:30,544 INFO L226 Difference]: Without dead ends: 856 [2022-07-20 22:34:30,545 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-20 22:34:30,546 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-20 22:34:30,546 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-20 22:34:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-07-20 22:34:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 662. [2022-07-20 22:34:30,562 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-20 22:34:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1016 transitions. [2022-07-20 22:34:30,564 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1016 transitions. Word has length 108 [2022-07-20 22:34:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:30,564 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1016 transitions. [2022-07-20 22:34:30,564 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-20 22:34:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1016 transitions. [2022-07-20 22:34:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 22:34:30,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:30,566 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-20 22:34:30,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 22:34:30,566 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -805941339, now seen corresponding path program 1 times [2022-07-20 22:34:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:30,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479840669] [2022-07-20 22:34:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:30,715 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-20 22:34:30,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:30,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479840669] [2022-07-20 22:34:30,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479840669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:30,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:30,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656161816] [2022-07-20 22:34:30,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:30,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:30,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:30,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:30,717 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-20 22:34:32,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-20 22:34:34,752 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-20 22:34:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:35,062 INFO L93 Difference]: Finished difference Result 1209 states and 1841 transitions. [2022-07-20 22:34:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:35,062 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-20 22:34:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:35,065 INFO L225 Difference]: With dead ends: 1209 [2022-07-20 22:34:35,065 INFO L226 Difference]: Without dead ends: 785 [2022-07-20 22:34:35,066 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-20 22:34:35,066 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-20 22:34:35,067 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-20 22:34:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-07-20 22:34:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 662. [2022-07-20 22:34:35,093 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-20 22:34:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1014 transitions. [2022-07-20 22:34:35,095 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1014 transitions. Word has length 108 [2022-07-20 22:34:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:35,095 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 1014 transitions. [2022-07-20 22:34:35,096 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-20 22:34:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1014 transitions. [2022-07-20 22:34:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 22:34:35,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:35,097 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-20 22:34:35,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 22:34:35,098 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:35,098 INFO L85 PathProgramCache]: Analyzing trace with hash -82572025, now seen corresponding path program 1 times [2022-07-20 22:34:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:35,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921908144] [2022-07-20 22:34:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:35,293 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-20 22:34:35,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:35,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921908144] [2022-07-20 22:34:35,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921908144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:35,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:35,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667907451] [2022-07-20 22:34:35,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:35,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:35,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:35,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:35,295 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-20 22:34:37,307 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-20 22:34:39,326 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-20 22:34:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:39,622 INFO L93 Difference]: Finished difference Result 1433 states and 2183 transitions. [2022-07-20 22:34:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:39,623 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-20 22:34:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:39,626 INFO L225 Difference]: With dead ends: 1433 [2022-07-20 22:34:39,626 INFO L226 Difference]: Without dead ends: 781 [2022-07-20 22:34:39,627 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-20 22:34:39,628 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-20 22:34:39,628 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-20 22:34:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-07-20 22:34:39,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 692. [2022-07-20 22:34:39,642 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-20 22:34:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1064 transitions. [2022-07-20 22:34:39,644 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1064 transitions. Word has length 108 [2022-07-20 22:34:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:39,644 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1064 transitions. [2022-07-20 22:34:39,645 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-20 22:34:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1064 transitions. [2022-07-20 22:34:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 22:34:39,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:39,646 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-20 22:34:39,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 22:34:39,647 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash 803875412, now seen corresponding path program 1 times [2022-07-20 22:34:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345076111] [2022-07-20 22:34:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:39,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:39,843 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-20 22:34:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:39,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345076111] [2022-07-20 22:34:39,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345076111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:39,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:39,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598455938] [2022-07-20 22:34:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:39,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:39,846 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-20 22:34:41,856 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-20 22:34:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:42,107 INFO L93 Difference]: Finished difference Result 1568 states and 2384 transitions. [2022-07-20 22:34:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:42,107 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-20 22:34:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:42,110 INFO L225 Difference]: With dead ends: 1568 [2022-07-20 22:34:42,110 INFO L226 Difference]: Without dead ends: 886 [2022-07-20 22:34:42,111 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-20 22:34:42,112 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-20 22:34:42,112 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-20 22:34:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-07-20 22:34:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 731. [2022-07-20 22:34:42,130 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-20 22:34:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1139 transitions. [2022-07-20 22:34:42,131 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1139 transitions. Word has length 108 [2022-07-20 22:34:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:42,132 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1139 transitions. [2022-07-20 22:34:42,132 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-20 22:34:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1139 transitions. [2022-07-20 22:34:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 22:34:42,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:42,134 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-20 22:34:42,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 22:34:42,134 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1155633319, now seen corresponding path program 1 times [2022-07-20 22:34:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:42,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646492094] [2022-07-20 22:34:42,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:42,384 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-20 22:34:42,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:42,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646492094] [2022-07-20 22:34:42,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646492094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:42,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:42,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:42,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969207727] [2022-07-20 22:34:42,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:42,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:42,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:42,388 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-20 22:34:44,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-20 22:34:46,417 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-20 22:34:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:46,657 INFO L93 Difference]: Finished difference Result 1239 states and 1920 transitions. [2022-07-20 22:34:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:46,658 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-20 22:34:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:46,670 INFO L225 Difference]: With dead ends: 1239 [2022-07-20 22:34:46,670 INFO L226 Difference]: Without dead ends: 774 [2022-07-20 22:34:46,671 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-20 22:34:46,672 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-20 22:34:46,672 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-20 22:34:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-07-20 22:34:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 731. [2022-07-20 22:34:46,692 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-20 22:34:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1137 transitions. [2022-07-20 22:34:46,693 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1137 transitions. Word has length 108 [2022-07-20 22:34:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:46,693 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1137 transitions. [2022-07-20 22:34:46,694 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-20 22:34:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1137 transitions. [2022-07-20 22:34:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-20 22:34:46,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:46,695 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-20 22:34:46,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 22:34:46,696 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:46,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash 446496737, now seen corresponding path program 1 times [2022-07-20 22:34:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:46,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694845061] [2022-07-20 22:34:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:46,846 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-20 22:34:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:46,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694845061] [2022-07-20 22:34:46,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694845061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:46,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:46,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708098287] [2022-07-20 22:34:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:46,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:46,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:46,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:46,848 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-20 22:34:48,857 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-20 22:34:50,880 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-20 22:34:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:51,139 INFO L93 Difference]: Finished difference Result 1523 states and 2353 transitions. [2022-07-20 22:34:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:51,143 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-20 22:34:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:51,146 INFO L225 Difference]: With dead ends: 1523 [2022-07-20 22:34:51,147 INFO L226 Difference]: Without dead ends: 802 [2022-07-20 22:34:51,148 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-20 22:34:51,148 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-20 22:34:51,149 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-20 22:34:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-20 22:34:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 731. [2022-07-20 22:34:51,165 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-20 22:34:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1135 transitions. [2022-07-20 22:34:51,167 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1135 transitions. Word has length 109 [2022-07-20 22:34:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:51,167 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1135 transitions. [2022-07-20 22:34:51,167 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-20 22:34:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1135 transitions. [2022-07-20 22:34:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-20 22:34:51,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:51,169 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-20 22:34:51,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 22:34:51,169 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:51,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -585249362, now seen corresponding path program 1 times [2022-07-20 22:34:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:51,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8969081] [2022-07-20 22:34:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:51,346 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-20 22:34:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8969081] [2022-07-20 22:34:51,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8969081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:51,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:51,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:51,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656433648] [2022-07-20 22:34:51,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:51,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:51,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:51,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:51,349 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-20 22:34:53,358 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-20 22:34:55,378 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-20 22:34:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:55,631 INFO L93 Difference]: Finished difference Result 1260 states and 1943 transitions. [2022-07-20 22:34:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:55,636 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-20 22:34:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:55,639 INFO L225 Difference]: With dead ends: 1260 [2022-07-20 22:34:55,639 INFO L226 Difference]: Without dead ends: 795 [2022-07-20 22:34:55,640 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-20 22:34:55,640 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-20 22:34:55,640 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-20 22:34:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-07-20 22:34:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 731. [2022-07-20 22:34:55,657 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-20 22:34:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1133 transitions. [2022-07-20 22:34:55,658 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1133 transitions. Word has length 109 [2022-07-20 22:34:55,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:55,659 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1133 transitions. [2022-07-20 22:34:55,659 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-20 22:34:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1133 transitions. [2022-07-20 22:34:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-20 22:34:55,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:55,661 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-20 22:34:55,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 22:34:55,661 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:55,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash 147177277, now seen corresponding path program 1 times [2022-07-20 22:34:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:55,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047846613] [2022-07-20 22:34:55,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:55,842 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-20 22:34:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:55,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047846613] [2022-07-20 22:34:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047846613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:55,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:55,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624589566] [2022-07-20 22:34:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:55,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:55,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:55,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:55,844 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-20 22:34:57,854 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-20 22:34:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:34:58,115 INFO L93 Difference]: Finished difference Result 1601 states and 2438 transitions. [2022-07-20 22:34:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:34:58,116 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-20 22:34:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:34:58,119 INFO L225 Difference]: With dead ends: 1601 [2022-07-20 22:34:58,119 INFO L226 Difference]: Without dead ends: 880 [2022-07-20 22:34:58,120 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-20 22:34:58,120 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 87 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:34:58,121 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.2s Time] [2022-07-20 22:34:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-20 22:34:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-20 22:34:58,138 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-20 22:34:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1136 transitions. [2022-07-20 22:34:58,139 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1136 transitions. Word has length 109 [2022-07-20 22:34:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:34:58,140 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1136 transitions. [2022-07-20 22:34:58,140 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-20 22:34:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1136 transitions. [2022-07-20 22:34:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-20 22:34:58,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:34:58,142 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-20 22:34:58,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 22:34:58,142 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:34:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:34:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1125768991, now seen corresponding path program 1 times [2022-07-20 22:34:58,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:34:58,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737155588] [2022-07-20 22:34:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:34:58,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:34:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:34:58,340 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-20 22:34:58,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:34:58,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737155588] [2022-07-20 22:34:58,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737155588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:34:58,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:34:58,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:34:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060070865] [2022-07-20 22:34:58,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:34:58,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:34:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:34:58,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:34:58,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:34:58,342 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-20 22:35:00,352 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-20 22:35:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:00,622 INFO L93 Difference]: Finished difference Result 1604 states and 2438 transitions. [2022-07-20 22:35:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:35:00,623 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-20 22:35:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:00,626 INFO L225 Difference]: With dead ends: 1604 [2022-07-20 22:35:00,626 INFO L226 Difference]: Without dead ends: 880 [2022-07-20 22:35:00,627 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-20 22:35:00,631 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:35:00,632 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.3s Time] [2022-07-20 22:35:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-20 22:35:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-20 22:35:00,649 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-20 22:35:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1125 transitions. [2022-07-20 22:35:00,650 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1125 transitions. Word has length 109 [2022-07-20 22:35:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:00,651 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1125 transitions. [2022-07-20 22:35:00,651 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-20 22:35:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1125 transitions. [2022-07-20 22:35:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-20 22:35:00,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:00,654 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-20 22:35:00,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 22:35:00,654 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:00,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash 94022892, now seen corresponding path program 1 times [2022-07-20 22:35:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:35:00,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233420414] [2022-07-20 22:35:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:00,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:35:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:00,825 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-20 22:35:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:35:00,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233420414] [2022-07-20 22:35:00,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233420414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:35:00,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:35:00,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:35:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571908100] [2022-07-20 22:35:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:35:00,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:35:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:35:00,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:35:00,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:35:00,827 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-20 22:35:02,838 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-20 22:35:04,857 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-20 22:35:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:05,017 INFO L93 Difference]: Finished difference Result 1219 states and 1867 transitions. [2022-07-20 22:35:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:35:05,018 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-20 22:35:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:05,020 INFO L225 Difference]: With dead ends: 1219 [2022-07-20 22:35:05,021 INFO L226 Difference]: Without dead ends: 752 [2022-07-20 22:35:05,021 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-20 22:35:05,022 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-20 22:35:05,022 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-20 22:35:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-20 22:35:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 734. [2022-07-20 22:35:05,039 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-20 22:35:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1123 transitions. [2022-07-20 22:35:05,041 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1123 transitions. Word has length 109 [2022-07-20 22:35:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:05,041 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1123 transitions. [2022-07-20 22:35:05,041 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-20 22:35:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1123 transitions. [2022-07-20 22:35:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 22:35:05,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:05,043 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-20 22:35:05,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 22:35:05,044 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1469182628, now seen corresponding path program 1 times [2022-07-20 22:35:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:35:05,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261086481] [2022-07-20 22:35:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:05,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:35:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:05,225 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-20 22:35:05,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:35:05,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261086481] [2022-07-20 22:35:05,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261086481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:35:05,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:35:05,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:35:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487825389] [2022-07-20 22:35:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:35:05,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:35:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:35:05,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:35:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:35:05,227 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-20 22:35:07,235 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-20 22:35:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:07,494 INFO L93 Difference]: Finished difference Result 1604 states and 2412 transitions. [2022-07-20 22:35:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:35:07,494 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-20 22:35:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:07,497 INFO L225 Difference]: With dead ends: 1604 [2022-07-20 22:35:07,497 INFO L226 Difference]: Without dead ends: 880 [2022-07-20 22:35:07,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-20 22:35:07,498 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:35:07,499 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.2s Time] [2022-07-20 22:35:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-20 22:35:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 734. [2022-07-20 22:35:07,517 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-20 22:35:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1112 transitions. [2022-07-20 22:35:07,518 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1112 transitions. Word has length 110 [2022-07-20 22:35:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:07,519 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1112 transitions. [2022-07-20 22:35:07,519 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-20 22:35:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1112 transitions. [2022-07-20 22:35:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 22:35:07,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:07,521 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-20 22:35:07,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 22:35:07,521 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash 797770585, now seen corresponding path program 1 times [2022-07-20 22:35:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:35:07,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786794398] [2022-07-20 22:35:07,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:07,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:35:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:07,691 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-20 22:35:07,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:35:07,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786794398] [2022-07-20 22:35:07,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786794398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:35:07,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:35:07,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:35:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864764860] [2022-07-20 22:35:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:35:07,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:35:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:35:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:35:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:35:07,693 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-20 22:35:09,701 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-20 22:35:11,721 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-20 22:35:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:11,954 INFO L93 Difference]: Finished difference Result 1508 states and 2274 transitions. [2022-07-20 22:35:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:35:11,955 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-20 22:35:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:11,957 INFO L225 Difference]: With dead ends: 1508 [2022-07-20 22:35:11,957 INFO L226 Difference]: Without dead ends: 784 [2022-07-20 22:35:11,957 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-20 22:35:11,959 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-20 22:35:11,959 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-20 22:35:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-20 22:35:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 740. [2022-07-20 22:35:11,987 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-20 22:35:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1118 transitions. [2022-07-20 22:35:11,988 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1118 transitions. Word has length 110 [2022-07-20 22:35:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:11,989 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1118 transitions. [2022-07-20 22:35:11,989 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-20 22:35:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1118 transitions. [2022-07-20 22:35:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 22:35:11,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:11,999 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-20 22:35:11,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 22:35:12,000 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:12,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:12,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1886579234, now seen corresponding path program 1 times [2022-07-20 22:35:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:35:12,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362466192] [2022-07-20 22:35:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:12,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:35:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:12,164 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-20 22:35:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:35:12,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362466192] [2022-07-20 22:35:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362466192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:35:12,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:35:12,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:35:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266243663] [2022-07-20 22:35:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:35:12,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:35:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:35:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:35:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:35:12,167 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-20 22:35:14,174 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-20 22:35:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:14,227 INFO L93 Difference]: Finished difference Result 1472 states and 2231 transitions. [2022-07-20 22:35:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:35:14,228 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-20 22:35:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:14,231 INFO L225 Difference]: With dead ends: 1472 [2022-07-20 22:35:14,231 INFO L226 Difference]: Without dead ends: 1004 [2022-07-20 22:35:14,232 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-20 22:35:14,233 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-20 22:35:14,233 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-20 22:35:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-07-20 22:35:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2022-07-20 22:35:14,252 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-20 22:35:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1514 transitions. [2022-07-20 22:35:14,254 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1514 transitions. Word has length 110 [2022-07-20 22:35:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:14,254 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1514 transitions. [2022-07-20 22:35:14,254 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-20 22:35:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1514 transitions. [2022-07-20 22:35:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-20 22:35:14,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:14,256 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-20 22:35:14,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 22:35:14,257 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:14,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2022-07-20 22:35:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:35:14,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070167517] [2022-07-20 22:35:14,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:35:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:35:15,273 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 22:35:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:35:15,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 22:35:15,652 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 22:35:15,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:35:15,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 22:35:15,657 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-20 22:35:15,660 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:35:15,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:35:15 BoogieIcfgContainer [2022-07-20 22:35:15,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:35:15,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:35:15,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:35:15,777 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:35:15,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:33:42" (3/4) ... [2022-07-20 22:35:15,779 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 22:35:15,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:35:15,780 INFO L158 Benchmark]: Toolchain (without parser) took 97673.15ms. Allocated memory was 60.8MB in the beginning and 209.7MB in the end (delta: 148.9MB). Free memory was 45.0MB in the beginning and 54.1MB in the end (delta: -9.1MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2022-07-20 22:35:15,780 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 48.2MB. Free memory was 30.6MB in the beginning and 30.5MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:35:15,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.49ms. Allocated memory is still 60.8MB. Free memory was 44.7MB in the beginning and 40.2MB in the end (delta: 4.6MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-07-20 22:35:15,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.09ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 35.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 22:35:15,781 INFO L158 Benchmark]: Boogie Preprocessor took 106.83ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 28.6MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 22:35:15,781 INFO L158 Benchmark]: RCFGBuilder took 3148.93ms. Allocated memory was 60.8MB in the beginning and 98.6MB in the end (delta: 37.7MB). Free memory was 28.6MB in the beginning and 57.3MB in the end (delta: -28.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-07-20 22:35:15,781 INFO L158 Benchmark]: TraceAbstraction took 93767.29ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 56.8MB in the beginning and 55.2MB in the end (delta: 1.6MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB. [2022-07-20 22:35:15,782 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 209.7MB. Free memory was 55.2MB in the beginning and 54.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:35:15,783 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.53ms. Allocated memory is still 48.2MB. Free memory was 30.6MB in the beginning and 30.5MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.49ms. Allocated memory is still 60.8MB. Free memory was 44.7MB in the beginning and 40.2MB in the end (delta: 4.6MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.09ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 35.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.83ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 28.6MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3148.93ms. Allocated memory was 60.8MB in the beginning and 98.6MB in the end (delta: 37.7MB). Free memory was 28.6MB in the beginning and 57.3MB in the end (delta: -28.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 93767.29ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 56.8MB in the beginning and 55.2MB in the end (delta: 1.6MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 209.7MB. Free memory was 55.2MB in the beginning and 54.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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.6s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 85.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 2305 SdHoareTripleChecker+Valid, 84.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2305 mSDsluCounter, 10866 SdHoareTripleChecker+Invalid, 82.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6243 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4770 IncrementalHoareTripleChecker+Invalid, 5352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 4623 mSDtfsCounter, 4770 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 39 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.7s SatisfiabilityAnalysisTime, 2.1s 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-20 22:35:15,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-?-3598765 [2022-07-20 22:35:17,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:35:17,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:35:17,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:35:17,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:35:17,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:35:17,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:35:17,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:35:17,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:35:17,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:35:17,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:35:17,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:35:17,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:35:17,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:35:17,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:35:17,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:35:17,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:35:17,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:35:17,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:35:17,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:35:17,704 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:35:17,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:35:17,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:35:17,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:35:17,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:35:17,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:35:17,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:35:17,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:35:17,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:35:17,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:35:17,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:35:17,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:35:17,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:35:17,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:35:17,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:35:17,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:35:17,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:35:17,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:35:17,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:35:17,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:35:17,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:35:17,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:35:17,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-20 22:35:17,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:35:17,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:35:17,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:35:17,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:35:17,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:35:17,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:35:17,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:35:17,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:35:17,761 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:35:17,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:35:17,762 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:35:17,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:35:17,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:35:17,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:35:17,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:35:17,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:35:17,763 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 22:35:17,763 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 22:35:17,763 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 22:35:17,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:35:17,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:35:17,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:35:17,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:35:17,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:35:17,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:35:17,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:35:17,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:35:17,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:35:17,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:35:17,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:35:17,766 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 22:35:17,766 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 22:35:17,766 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:35:17,767 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:35:17,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:35:17,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 22:35:17,767 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-20 22:35:18,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:35:18,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:35:18,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:35:18,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:35:18,094 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:35:18,096 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-20 22:35:18,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fc411b1/ee41e10890594089a9b2f15ca352368b/FLAG392536739 [2022-07-20 22:35:18,651 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:35:18,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2022-07-20 22:35:18,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fc411b1/ee41e10890594089a9b2f15ca352368b/FLAG392536739 [2022-07-20 22:35:18,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fc411b1/ee41e10890594089a9b2f15ca352368b [2022-07-20 22:35:18,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:35:18,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:35:18,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:35:18,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:35:18,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:35:18,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:35:18" (1/1) ... [2022-07-20 22:35:18,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c8f206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:18, skipping insertion in model container [2022-07-20 22:35:18,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:35:18" (1/1) ... [2022-07-20 22:35:18,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:35:19,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:35:19,344 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-20 22:35:19,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:35:19,363 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 22:35:19,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:35:19,493 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-20 22:35:19,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:35:19,502 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:35:19,576 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-20 22:35:19,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:35:19,603 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:35:19,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19 WrapperNode [2022-07-20 22:35:19,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:35:19,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:35:19,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:35:19,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:35:19,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,705 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 689 [2022-07-20 22:35:19,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:35:19,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:35:19,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:35:19,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:35:19,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:35:19,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:35:19,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:35:19,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:35:19,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (1/1) ... [2022-07-20 22:35:19,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:35:19,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:35:19,836 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-20 22:35:19,850 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-20 22:35:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:35:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 22:35:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 22:35:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 22:35:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 22:35:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:35:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:35:19,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:35:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 22:35:20,035 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:35:20,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:35:20,066 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:35:27,481 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-20 22:35:27,482 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-20 22:35:27,482 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:35:27,487 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:35:27,488 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 22:35:27,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:35:27 BoogieIcfgContainer [2022-07-20 22:35:27,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:35:27,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:35:27,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:35:27,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:35:27,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:35:18" (1/3) ... [2022-07-20 22:35:27,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b61c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:35:27, skipping insertion in model container [2022-07-20 22:35:27,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:35:19" (2/3) ... [2022-07-20 22:35:27,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b61c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:35:27, skipping insertion in model container [2022-07-20 22:35:27,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:35:27" (3/3) ... [2022-07-20 22:35:27,497 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-07-20 22:35:27,508 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:35:27,508 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:35:27,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:35:27,588 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@20fcf0d7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@497c5a58 [2022-07-20 22:35:27,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:35:27,592 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-20 22:35:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:35:27,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:27,601 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-20 22:35:27,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-20 22:35:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:35:27,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063531908] [2022-07-20 22:35:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:27,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:35:27,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:35:27,631 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-20 22:35:27,670 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-20 22:35:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:28,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:35:28,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:35:28,563 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-20 22:35:28,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:35:28,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:35:28,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063531908] [2022-07-20 22:35:28,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063531908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:35:28,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:35:28,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:35:28,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900995086] [2022-07-20 22:35:28,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:35:28,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:35:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:35:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:35:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:35:28,598 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-20 22:35:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:28,729 INFO L93 Difference]: Finished difference Result 368 states and 621 transitions. [2022-07-20 22:35:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:35:28,731 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-20 22:35:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:28,743 INFO L225 Difference]: With dead ends: 368 [2022-07-20 22:35:28,743 INFO L226 Difference]: Without dead ends: 212 [2022-07-20 22:35:28,747 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-20 22:35:28,751 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 179 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 22:35:28,754 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-20 22:35:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-20 22:35:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-07-20 22:35:28,799 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-20 22:35:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 316 transitions. [2022-07-20 22:35:28,801 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 316 transitions. Word has length 24 [2022-07-20 22:35:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:28,802 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 316 transitions. [2022-07-20 22:35:28,802 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-20 22:35:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 316 transitions. [2022-07-20 22:35:28,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:35:28,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:28,806 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-20 22:35:28,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 22:35:29,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:35:29,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1509035189, now seen corresponding path program 1 times [2022-07-20 22:35:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:35:29,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422784797] [2022-07-20 22:35:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:29,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:35:29,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:35:29,021 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-20 22:35:29,023 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-20 22:35:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:29,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:35:29,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:35:29,993 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-20 22:35:29,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:35:29,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:35:29,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422784797] [2022-07-20 22:35:29,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422784797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:35:29,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:35:29,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:35:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027789563] [2022-07-20 22:35:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:35:29,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:35:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:35:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:35:29,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:35:29,996 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-20 22:35:32,020 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-20 22:35:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:32,101 INFO L93 Difference]: Finished difference Result 417 states and 627 transitions. [2022-07-20 22:35:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:35:32,102 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-20 22:35:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:32,104 INFO L225 Difference]: With dead ends: 417 [2022-07-20 22:35:32,104 INFO L226 Difference]: Without dead ends: 312 [2022-07-20 22:35:32,105 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-20 22:35:32,106 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-20 22:35:32,106 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-20 22:35:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-20 22:35:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-20 22:35:32,119 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-20 22:35:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2022-07-20 22:35:32,120 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 39 [2022-07-20 22:35:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:32,121 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2022-07-20 22:35:32,121 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-20 22:35:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2022-07-20 22:35:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 22:35:32,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:32,124 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-20 22:35:32,154 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-20 22:35:32,343 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-20 22:35:32,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1699665034, now seen corresponding path program 1 times [2022-07-20 22:35:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:35:32,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694110344] [2022-07-20 22:35:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:35:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:35:32,347 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-20 22:35:32,350 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-20 22:35:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:33,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:35:33,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:35:33,321 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-20 22:35:33,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:35:33,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:35:33,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694110344] [2022-07-20 22:35:33,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694110344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:35:33,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:35:33,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:35:33,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200014410] [2022-07-20 22:35:33,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:35:33,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:35:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:35:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:35:33,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:35:33,323 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-20 22:35:35,345 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-20 22:35:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:35,436 INFO L93 Difference]: Finished difference Result 619 states and 924 transitions. [2022-07-20 22:35:35,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:35:35,437 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-20 22:35:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:35,439 INFO L225 Difference]: With dead ends: 619 [2022-07-20 22:35:35,439 INFO L226 Difference]: Without dead ends: 414 [2022-07-20 22:35:35,440 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-20 22:35:35,441 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-20 22:35:35,441 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-20 22:35:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-20 22:35:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-20 22:35:35,453 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-20 22:35:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2022-07-20 22:35:35,454 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2022-07-20 22:35:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:35,455 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2022-07-20 22:35:35,455 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-20 22:35:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2022-07-20 22:35:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 22:35:35,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:35,458 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-20 22:35:35,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-20 22:35:35,671 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-20 22:35:35,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1132708561, now seen corresponding path program 1 times [2022-07-20 22:35:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:35:35,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478079425] [2022-07-20 22:35:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:35,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:35:35,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:35:35,675 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-20 22:35:35,677 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-20 22:35:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:36,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:35:36,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:35:36,671 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-20 22:35:36,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:35:36,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:35:36,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478079425] [2022-07-20 22:35:36,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478079425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:35:36,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:35:36,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:35:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989097546] [2022-07-20 22:35:36,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:35:36,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:35:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:35:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:35:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:35:36,673 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-20 22:35:38,695 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-20 22:35:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:35:38,778 INFO L93 Difference]: Finished difference Result 822 states and 1223 transitions. [2022-07-20 22:35:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:35:38,778 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-20 22:35:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:35:38,781 INFO L225 Difference]: With dead ends: 822 [2022-07-20 22:35:38,781 INFO L226 Difference]: Without dead ends: 515 [2022-07-20 22:35:38,782 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-20 22:35:38,782 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-20 22:35:38,783 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-20 22:35:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-20 22:35:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-07-20 22:35:38,792 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-20 22:35:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2022-07-20 22:35:38,794 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2022-07-20 22:35:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:35:38,794 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2022-07-20 22:35:38,795 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-20 22:35:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2022-07-20 22:35:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 22:35:38,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:35:38,798 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-20 22:35:38,821 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-20 22:35:39,011 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-20 22:35:39,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:35:39,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:35:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1093818034, now seen corresponding path program 1 times [2022-07-20 22:35:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:35:39,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035007049] [2022-07-20 22:35:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:35:39,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:35:39,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:35:39,015 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-20 22:35:39,016 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-20 22:35:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:35:40,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:35:40,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:35:42,197 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-20 22:35:42,198 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-20 22:35:57,630 WARN L233 SmtUtils]: Spent 15.34s 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-20 22:35:57,632 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-20 22:35:57,633 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-20 22:35:57,715 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-20 22:35:58,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:35:58,299 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-20 22:35:59,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:35:59,173 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-20 22:35:59,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:35:59,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:00,740 INFO L244 Elim1Store]: Index analysis took 1065 ms [2022-07-20 22:36:01,665 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-20 22:36:02,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:02,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:03,159 INFO L244 Elim1Store]: Index analysis took 771 ms [2022-07-20 22:36:03,668 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-20 22:36:04,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:36:04,582 INFO L244 Elim1Store]: Index analysis took 548 ms [2022-07-20 22:36:04,984 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-20 22:36:05,633 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-20 22:36:06,151 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-20 22:36:06,444 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