./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.09.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 7b66a12741a993de3de45354c2fb746af1f1a44b9ceb94bb607376650a8088af --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:53:07,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:53:07,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:53:07,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:53:07,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:53:07,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:53:07,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:53:07,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:53:07,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:53:07,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:53:07,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:53:07,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:53:07,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:53:07,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:53:07,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:53:07,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:53:07,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:53:07,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:53:07,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:53:07,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:53:07,908 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:53:07,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:53:07,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:53:07,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:53:07,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:53:07,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:53:07,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:53:07,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:53:07,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:53:07,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:53:07,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:53:07,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:53:07,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:53:07,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:53:07,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:53:07,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:53:07,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:53:07,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:53:07,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:53:07,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:53:07,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:53:07,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:53:07,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:53:07,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:53:07,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:53:07,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:53:07,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:53:07,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:53:07,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:53:07,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:53:07,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:53:07,953 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:53:07,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:53:07,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:53:07,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:53:07,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:53:07,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:53:07,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:53:07,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:53:07,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:53:07,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:53:07,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:53:07,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:53:07,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:53:07,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:53:07,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:53:07,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:53:07,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:53:07,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:53:07,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:53:07,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:53:07,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:53:07,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:53:07,957 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:53:07,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:53:07,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:53:07,958 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 -> 7b66a12741a993de3de45354c2fb746af1f1a44b9ceb94bb607376650a8088af [2022-07-11 23:53:08,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:53:08,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:53:08,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:53:08,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:53:08,173 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:53:08,173 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-11 23:53:08,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1de80439/8e588b3cc85d4e14a51269bf9e1ae01f/FLAG73127bf4f [2022-07-11 23:53:08,627 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:53:08,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-11 23:53:08,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1de80439/8e588b3cc85d4e14a51269bf9e1ae01f/FLAG73127bf4f [2022-07-11 23:53:08,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1de80439/8e588b3cc85d4e14a51269bf9e1ae01f [2022-07-11 23:53:08,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:53:08,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:53:08,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:53:08,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:53:08,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:53:08,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:53:08" (1/1) ... [2022-07-11 23:53:08,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19aff276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:08, skipping insertion in model container [2022-07-11 23:53:08,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:53:08" (1/1) ... [2022-07-11 23:53:08,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:53:08,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:53:09,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-11 23:53:09,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:53:09,029 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:53:09,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-11 23:53:09,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:53:09,116 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:53:09,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09 WrapperNode [2022-07-11 23:53:09,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:53:09,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:53:09,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:53:09,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:53:09,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,200 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2022-07-11 23:53:09,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:53:09,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:53:09,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:53:09,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:53:09,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:53:09,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:53:09,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:53:09,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:53:09,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (1/1) ... [2022-07-11 23:53:09,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:53:09,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:09,308 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-11 23:53:09,314 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-11 23:53:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:53:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:53:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:53:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:53:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:53:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:53:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:53:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:53:09,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:53:09,479 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:53:09,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:53:09,507 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:53:10,423 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:53:10,424 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:53:10,424 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:53:10,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:53:10,430 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:53:10,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:53:10 BoogieIcfgContainer [2022-07-11 23:53:10,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:53:10,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:53:10,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:53:10,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:53:10,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:53:08" (1/3) ... [2022-07-11 23:53:10,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d9b52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:53:10, skipping insertion in model container [2022-07-11 23:53:10,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:09" (2/3) ... [2022-07-11 23:53:10,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d9b52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:53:10, skipping insertion in model container [2022-07-11 23:53:10,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:53:10" (3/3) ... [2022-07-11 23:53:10,437 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2022-07-11 23:53:10,446 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:53:10,446 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:53:10,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:53:10,489 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@4cf42b1a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bbb35fd [2022-07-11 23:53:10,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:53:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:53:10,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:10,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:10,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash -442385418, now seen corresponding path program 1 times [2022-07-11 23:53:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749865684] [2022-07-11 23:53:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:10,961 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-11 23:53:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:10,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749865684] [2022-07-11 23:53:10,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749865684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:10,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:10,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:10,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857593849] [2022-07-11 23:53:10,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:10,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:10,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:10,997 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:11,723 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2022-07-11 23:53:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-11 23:53:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:11,734 INFO L225 Difference]: With dead ends: 421 [2022-07-11 23:53:11,734 INFO L226 Difference]: Without dead ends: 256 [2022-07-11 23:53:11,736 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-11 23:53:11,738 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:11,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:53:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-11 23:53:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-07-11 23:53:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2022-07-11 23:53:11,773 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2022-07-11 23:53:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:11,774 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2022-07-11 23:53:11,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2022-07-11 23:53:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:53:11,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:11,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:11,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:53:11,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591930, now seen corresponding path program 1 times [2022-07-11 23:53:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57752305] [2022-07-11 23:53:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:11,890 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-11 23:53:11,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57752305] [2022-07-11 23:53:11,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57752305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:11,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:11,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782772696] [2022-07-11 23:53:11,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:11,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:11,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:11,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:11,893 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:12,434 INFO L93 Difference]: Finished difference Result 348 states and 547 transitions. [2022-07-11 23:53:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:12,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-11 23:53:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:12,435 INFO L225 Difference]: With dead ends: 348 [2022-07-11 23:53:12,436 INFO L226 Difference]: Without dead ends: 193 [2022-07-11 23:53:12,436 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-11 23:53:12,437 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:12,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:53:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-11 23:53:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2022-07-11 23:53:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.5942857142857143) internal successors, (279), 175 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 279 transitions. [2022-07-11 23:53:12,460 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 279 transitions. Word has length 38 [2022-07-11 23:53:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:12,461 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 279 transitions. [2022-07-11 23:53:12,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 279 transitions. [2022-07-11 23:53:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 23:53:12,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:12,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:12,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:53:12,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:12,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:12,463 INFO L85 PathProgramCache]: Analyzing trace with hash 103815440, now seen corresponding path program 1 times [2022-07-11 23:53:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:12,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666929353] [2022-07-11 23:53:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:12,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:12,601 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-11 23:53:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666929353] [2022-07-11 23:53:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666929353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:12,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:12,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560769075] [2022-07-11 23:53:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:12,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:12,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:12,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:12,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:12,605 INFO L87 Difference]: Start difference. First operand 176 states and 279 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-11 23:53:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:13,619 INFO L93 Difference]: Finished difference Result 478 states and 761 transitions. [2022-07-11 23:53:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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 51 [2022-07-11 23:53:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:13,622 INFO L225 Difference]: With dead ends: 478 [2022-07-11 23:53:13,622 INFO L226 Difference]: Without dead ends: 323 [2022-07-11 23:53:13,623 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-11 23:53:13,624 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 147 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:13,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 620 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-11 23:53:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-11 23:53:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 208. [2022-07-11 23:53:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5942028985507246) internal successors, (330), 207 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 330 transitions. [2022-07-11 23:53:13,645 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 330 transitions. Word has length 51 [2022-07-11 23:53:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:13,646 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 330 transitions. [2022-07-11 23:53:13,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-11 23:53:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 330 transitions. [2022-07-11 23:53:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:53:13,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:13,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:13,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:53:13,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1022264289, now seen corresponding path program 1 times [2022-07-11 23:53:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:13,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646914991] [2022-07-11 23:53:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:13,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:13,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646914991] [2022-07-11 23:53:13,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646914991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:13,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:13,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009797642] [2022-07-11 23:53:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:13,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:13,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:13,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:13,787 INFO L87 Difference]: Start difference. First operand 208 states and 330 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:14,720 INFO L93 Difference]: Finished difference Result 497 states and 786 transitions. [2022-07-11 23:53:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-07-11 23:53:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:14,722 INFO L225 Difference]: With dead ends: 497 [2022-07-11 23:53:14,722 INFO L226 Difference]: Without dead ends: 310 [2022-07-11 23:53:14,723 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-11 23:53:14,724 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:14,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:53:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-11 23:53:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 208. [2022-07-11 23:53:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 207 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 326 transitions. [2022-07-11 23:53:14,732 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 326 transitions. Word has length 52 [2022-07-11 23:53:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:14,733 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 326 transitions. [2022-07-11 23:53:14,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 326 transitions. [2022-07-11 23:53:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:53:14,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:14,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:14,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:53:14,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash 40885771, now seen corresponding path program 1 times [2022-07-11 23:53:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:14,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087488588] [2022-07-11 23:53:14,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:14,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:14,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:14,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087488588] [2022-07-11 23:53:14,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087488588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:14,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228379209] [2022-07-11 23:53:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:14,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:14,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:14,830 INFO L87 Difference]: Start difference. First operand 208 states and 326 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:15,550 INFO L93 Difference]: Finished difference Result 411 states and 641 transitions. [2022-07-11 23:53:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:15,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-07-11 23:53:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:15,552 INFO L225 Difference]: With dead ends: 411 [2022-07-11 23:53:15,552 INFO L226 Difference]: Without dead ends: 224 [2022-07-11 23:53:15,552 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-11 23:53:15,553 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 26 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:15,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:53:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-11 23:53:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2022-07-11 23:53:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.570048309178744) internal successors, (325), 207 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 325 transitions. [2022-07-11 23:53:15,559 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 325 transitions. Word has length 52 [2022-07-11 23:53:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:15,559 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 325 transitions. [2022-07-11 23:53:15,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 325 transitions. [2022-07-11 23:53:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:53:15,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:15,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:15,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:53:15,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:15,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash 861050644, now seen corresponding path program 1 times [2022-07-11 23:53:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:15,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966768479] [2022-07-11 23:53:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:15,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966768479] [2022-07-11 23:53:15,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966768479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:15,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:15,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253327114] [2022-07-11 23:53:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:15,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:15,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:15,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:15,645 INFO L87 Difference]: Start difference. First operand 208 states and 325 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:16,118 INFO L93 Difference]: Finished difference Result 410 states and 639 transitions. [2022-07-11 23:53:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:16,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-07-11 23:53:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:16,120 INFO L225 Difference]: With dead ends: 410 [2022-07-11 23:53:16,120 INFO L226 Difference]: Without dead ends: 223 [2022-07-11 23:53:16,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-11 23:53:16,121 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 19 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:16,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 475 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:53:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-11 23:53:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2022-07-11 23:53:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.565217391304348) internal successors, (324), 207 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 324 transitions. [2022-07-11 23:53:16,128 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 324 transitions. Word has length 52 [2022-07-11 23:53:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:16,129 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 324 transitions. [2022-07-11 23:53:16,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 324 transitions. [2022-07-11 23:53:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:53:16,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:16,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:16,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:53:16,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:16,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1296410196, now seen corresponding path program 1 times [2022-07-11 23:53:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:16,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466646963] [2022-07-11 23:53:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:16,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:16,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466646963] [2022-07-11 23:53:16,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466646963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:16,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:16,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315073822] [2022-07-11 23:53:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:16,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:16,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:16,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:16,229 INFO L87 Difference]: Start difference. First operand 208 states and 324 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:17,068 INFO L93 Difference]: Finished difference Result 497 states and 777 transitions. [2022-07-11 23:53:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-07-11 23:53:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:17,069 INFO L225 Difference]: With dead ends: 497 [2022-07-11 23:53:17,069 INFO L226 Difference]: Without dead ends: 310 [2022-07-11 23:53:17,070 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-11 23:53:17,070 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 145 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:17,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:53:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-11 23:53:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-07-11 23:53:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5528846153846154) internal successors, (323), 208 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2022-07-11 23:53:17,075 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 52 [2022-07-11 23:53:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:17,076 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2022-07-11 23:53:17,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2022-07-11 23:53:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:53:17,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:17,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:17,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:53:17,077 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash 585554567, now seen corresponding path program 1 times [2022-07-11 23:53:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:17,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093653965] [2022-07-11 23:53:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:17,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:17,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093653965] [2022-07-11 23:53:17,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093653965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:17,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:17,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:17,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913356868] [2022-07-11 23:53:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:17,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:17,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:17,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:17,175 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:18,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:18,459 INFO L93 Difference]: Finished difference Result 410 states and 635 transitions. [2022-07-11 23:53:18,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:18,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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-11 23:53:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:18,460 INFO L225 Difference]: With dead ends: 410 [2022-07-11 23:53:18,460 INFO L226 Difference]: Without dead ends: 222 [2022-07-11 23:53:18,460 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-11 23:53:18,462 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 22 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:18,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:53:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-11 23:53:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2022-07-11 23:53:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2022-07-11 23:53:18,466 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 53 [2022-07-11 23:53:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:18,466 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2022-07-11 23:53:18,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2022-07-11 23:53:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:53:18,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:18,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:18,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:53:18,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash -991616538, now seen corresponding path program 1 times [2022-07-11 23:53:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:18,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458101684] [2022-07-11 23:53:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:18,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:18,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458101684] [2022-07-11 23:53:18,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458101684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:18,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:18,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546610726] [2022-07-11 23:53:18,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:18,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:18,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:18,553 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:18,983 INFO L93 Difference]: Finished difference Result 498 states and 773 transitions. [2022-07-11 23:53:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:18,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-11 23:53:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:18,984 INFO L225 Difference]: With dead ends: 498 [2022-07-11 23:53:18,985 INFO L226 Difference]: Without dead ends: 310 [2022-07-11 23:53:18,985 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-11 23:53:18,985 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:18,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:53:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-11 23:53:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-07-11 23:53:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 208 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 318 transitions. [2022-07-11 23:53:18,990 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 318 transitions. Word has length 54 [2022-07-11 23:53:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:18,991 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 318 transitions. [2022-07-11 23:53:18,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 318 transitions. [2022-07-11 23:53:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:53:18,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:18,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:18,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:53:18,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash 373652162, now seen corresponding path program 1 times [2022-07-11 23:53:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:18,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83542527] [2022-07-11 23:53:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:19,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83542527] [2022-07-11 23:53:19,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83542527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:19,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:19,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064993906] [2022-07-11 23:53:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:19,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:19,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:19,076 INFO L87 Difference]: Start difference. First operand 209 states and 318 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:19,401 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-07-11 23:53:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:19,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-11 23:53:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:19,402 INFO L225 Difference]: With dead ends: 400 [2022-07-11 23:53:19,402 INFO L226 Difference]: Without dead ends: 212 [2022-07-11 23:53:19,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:19,403 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:19,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 493 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:53:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-11 23:53:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2022-07-11 23:53:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 208 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 317 transitions. [2022-07-11 23:53:19,406 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 317 transitions. Word has length 55 [2022-07-11 23:53:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:19,407 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 317 transitions. [2022-07-11 23:53:19,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 317 transitions. [2022-07-11 23:53:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:53:19,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:19,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:19,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:53:19,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1312076378, now seen corresponding path program 1 times [2022-07-11 23:53:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:19,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648173942] [2022-07-11 23:53:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:19,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:19,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648173942] [2022-07-11 23:53:19,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648173942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:19,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:19,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046705403] [2022-07-11 23:53:19,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:19,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:19,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:19,493 INFO L87 Difference]: Start difference. First operand 209 states and 317 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:20,397 INFO L93 Difference]: Finished difference Result 437 states and 668 transitions. [2022-07-11 23:53:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:20,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-11 23:53:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:20,400 INFO L225 Difference]: With dead ends: 437 [2022-07-11 23:53:20,400 INFO L226 Difference]: Without dead ends: 249 [2022-07-11 23:53:20,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:20,401 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:20,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:53:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-11 23:53:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2022-07-11 23:53:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5260869565217392) internal successors, (351), 230 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 351 transitions. [2022-07-11 23:53:20,405 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 351 transitions. Word has length 55 [2022-07-11 23:53:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:20,405 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 351 transitions. [2022-07-11 23:53:20,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 351 transitions. [2022-07-11 23:53:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-11 23:53:20,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:20,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:20,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:53:20,406 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:20,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:20,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1411411051, now seen corresponding path program 1 times [2022-07-11 23:53:20,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:20,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340171172] [2022-07-11 23:53:20,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:20,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:20,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:20,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340171172] [2022-07-11 23:53:20,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340171172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:20,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:20,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447178488] [2022-07-11 23:53:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:20,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:20,483 INFO L87 Difference]: Start difference. First operand 231 states and 351 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:21,334 INFO L93 Difference]: Finished difference Result 542 states and 833 transitions. [2022-07-11 23:53:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:21,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-07-11 23:53:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:21,337 INFO L225 Difference]: With dead ends: 542 [2022-07-11 23:53:21,337 INFO L226 Difference]: Without dead ends: 332 [2022-07-11 23:53:21,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:21,338 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 149 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:21,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:53:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-11 23:53:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2022-07-11 23:53:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2022-07-11 23:53:21,343 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 69 [2022-07-11 23:53:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:21,344 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2022-07-11 23:53:21,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2022-07-11 23:53:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-11 23:53:21,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:21,347 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:21,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:53:21,347 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2063391372, now seen corresponding path program 1 times [2022-07-11 23:53:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:21,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612092942] [2022-07-11 23:53:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:21,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:21,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612092942] [2022-07-11 23:53:21,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612092942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:21,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:21,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:21,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288669651] [2022-07-11 23:53:21,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:21,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:21,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:21,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:21,417 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:22,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:22,778 INFO L93 Difference]: Finished difference Result 541 states and 824 transitions. [2022-07-11 23:53:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-07-11 23:53:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:22,780 INFO L225 Difference]: With dead ends: 541 [2022-07-11 23:53:22,780 INFO L226 Difference]: Without dead ends: 331 [2022-07-11 23:53:22,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:22,781 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 142 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:22,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:53:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-11 23:53:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-11 23:53:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4978354978354977) internal successors, (346), 231 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 346 transitions. [2022-07-11 23:53:22,786 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 346 transitions. Word has length 69 [2022-07-11 23:53:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:22,786 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 346 transitions. [2022-07-11 23:53:22,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 346 transitions. [2022-07-11 23:53:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-11 23:53:22,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:22,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:22,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:53:22,787 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 122165287, now seen corresponding path program 1 times [2022-07-11 23:53:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:22,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835252517] [2022-07-11 23:53:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:22,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835252517] [2022-07-11 23:53:22,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835252517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:22,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:22,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:22,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063432188] [2022-07-11 23:53:22,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:22,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:22,875 INFO L87 Difference]: Start difference. First operand 232 states and 346 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:23,573 INFO L93 Difference]: Finished difference Result 542 states and 820 transitions. [2022-07-11 23:53:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-07-11 23:53:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:23,575 INFO L225 Difference]: With dead ends: 542 [2022-07-11 23:53:23,575 INFO L226 Difference]: Without dead ends: 331 [2022-07-11 23:53:23,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:23,576 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 146 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:23,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:53:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-11 23:53:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-11 23:53:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4805194805194806) internal successors, (342), 231 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2022-07-11 23:53:23,580 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 70 [2022-07-11 23:53:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:23,582 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2022-07-11 23:53:23,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2022-07-11 23:53:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-11 23:53:23,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:23,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:23,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:53:23,583 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1733152866, now seen corresponding path program 1 times [2022-07-11 23:53:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:23,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550302546] [2022-07-11 23:53:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:53:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:23,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550302546] [2022-07-11 23:53:23,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550302546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:23,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:23,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:23,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165088338] [2022-07-11 23:53:23,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:23,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:23,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:23,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:23,682 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:24,114 INFO L93 Difference]: Finished difference Result 450 states and 669 transitions. [2022-07-11 23:53:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:24,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-11 23:53:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:24,115 INFO L225 Difference]: With dead ends: 450 [2022-07-11 23:53:24,115 INFO L226 Difference]: Without dead ends: 239 [2022-07-11 23:53:24,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:24,116 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 26 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:24,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 513 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:53:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-11 23:53:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2022-07-11 23:53:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4761904761904763) internal successors, (341), 231 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2022-07-11 23:53:24,120 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 72 [2022-07-11 23:53:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:24,120 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2022-07-11 23:53:24,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2022-07-11 23:53:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:53:24,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:24,121 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:24,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:53:24,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash 293504549, now seen corresponding path program 1 times [2022-07-11 23:53:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640520823] [2022-07-11 23:53:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:53:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:24,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640520823] [2022-07-11 23:53:24,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640520823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:24,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:24,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584266987] [2022-07-11 23:53:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:24,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:24,208 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:25,402 INFO L93 Difference]: Finished difference Result 538 states and 797 transitions. [2022-07-11 23:53:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-11 23:53:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:25,404 INFO L225 Difference]: With dead ends: 538 [2022-07-11 23:53:25,404 INFO L226 Difference]: Without dead ends: 327 [2022-07-11 23:53:25,404 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-11 23:53:25,405 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 88 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:25,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 471 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-11 23:53:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-11 23:53:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 263. [2022-07-11 23:53:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4770992366412214) internal successors, (387), 262 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-07-11 23:53:25,409 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 77 [2022-07-11 23:53:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:25,409 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-07-11 23:53:25,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-07-11 23:53:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:53:25,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:25,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:25,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:53:25,410 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1950478749, now seen corresponding path program 1 times [2022-07-11 23:53:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:25,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088917208] [2022-07-11 23:53:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:25,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:53:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:25,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088917208] [2022-07-11 23:53:25,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088917208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:25,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:25,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701833740] [2022-07-11 23:53:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:25,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:25,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:25,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:25,492 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:25,835 INFO L93 Difference]: Finished difference Result 551 states and 815 transitions. [2022-07-11 23:53:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:25,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-11 23:53:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:25,837 INFO L225 Difference]: With dead ends: 551 [2022-07-11 23:53:25,837 INFO L226 Difference]: Without dead ends: 309 [2022-07-11 23:53:25,838 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-11 23:53:25,838 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 35 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:25,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 589 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:53:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-11 23:53:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 287. [2022-07-11 23:53:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.4755244755244756) internal successors, (422), 286 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 422 transitions. [2022-07-11 23:53:25,843 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 422 transitions. Word has length 77 [2022-07-11 23:53:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:25,843 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 422 transitions. [2022-07-11 23:53:25,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 422 transitions. [2022-07-11 23:53:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-11 23:53:25,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:25,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:25,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:53:25,844 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2009733770, now seen corresponding path program 1 times [2022-07-11 23:53:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:25,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744460579] [2022-07-11 23:53:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:53:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:25,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744460579] [2022-07-11 23:53:25,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744460579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:25,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:25,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:25,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388355170] [2022-07-11 23:53:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:25,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:25,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:25,921 INFO L87 Difference]: Start difference. First operand 287 states and 422 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:27,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:27,961 INFO L93 Difference]: Finished difference Result 617 states and 912 transitions. [2022-07-11 23:53:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-07-11 23:53:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:27,964 INFO L225 Difference]: With dead ends: 617 [2022-07-11 23:53:27,964 INFO L226 Difference]: Without dead ends: 351 [2022-07-11 23:53:27,964 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-11 23:53:27,965 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 77 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:27,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 469 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:53:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-11 23:53:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 297. [2022-07-11 23:53:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.489864864864865) internal successors, (441), 296 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2022-07-11 23:53:27,970 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 82 [2022-07-11 23:53:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:27,970 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2022-07-11 23:53:27,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2022-07-11 23:53:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-11 23:53:27,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:27,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:27,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:53:27,971 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:27,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2129799745, now seen corresponding path program 1 times [2022-07-11 23:53:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:27,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564361965] [2022-07-11 23:53:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:53:28,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:28,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564361965] [2022-07-11 23:53:28,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564361965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:28,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:28,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743234092] [2022-07-11 23:53:28,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:28,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:28,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:28,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:28,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:28,092 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:29,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:29,991 INFO L93 Difference]: Finished difference Result 621 states and 923 transitions. [2022-07-11 23:53:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 83 [2022-07-11 23:53:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:29,993 INFO L225 Difference]: With dead ends: 621 [2022-07-11 23:53:29,993 INFO L226 Difference]: Without dead ends: 345 [2022-07-11 23:53:29,994 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-11 23:53:29,994 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 70 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:29,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 475 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-11 23:53:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-11 23:53:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2022-07-11 23:53:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4882154882154883) internal successors, (442), 297 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions. [2022-07-11 23:53:29,999 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 83 [2022-07-11 23:53:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:29,999 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions. [2022-07-11 23:53:29,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2022-07-11 23:53:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-11 23:53:30,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:30,000 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:30,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:53:30,000 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1674400777, now seen corresponding path program 1 times [2022-07-11 23:53:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:30,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214157551] [2022-07-11 23:53:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-11 23:53:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:30,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214157551] [2022-07-11 23:53:30,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214157551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:30,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:30,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:53:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968742320] [2022-07-11 23:53:30,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:30,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:53:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:30,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:53:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:30,101 INFO L87 Difference]: Start difference. First operand 298 states and 442 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-11 23:53:31,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:31,854 INFO L93 Difference]: Finished difference Result 585 states and 872 transitions. [2022-07-11 23:53:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:53:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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 94 [2022-07-11 23:53:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:31,856 INFO L225 Difference]: With dead ends: 585 [2022-07-11 23:53:31,856 INFO L226 Difference]: Without dead ends: 308 [2022-07-11 23:53:31,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:53:31,857 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 149 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:31,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 354 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-11 23:53:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-11 23:53:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2022-07-11 23:53:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4803921568627452) internal successors, (453), 306 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 453 transitions. [2022-07-11 23:53:31,862 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 453 transitions. Word has length 94 [2022-07-11 23:53:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:31,862 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 453 transitions. [2022-07-11 23:53:31,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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-11 23:53:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 453 transitions. [2022-07-11 23:53:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-11 23:53:31,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:31,864 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:31,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:53:31,864 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1278038072, now seen corresponding path program 1 times [2022-07-11 23:53:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:31,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738077552] [2022-07-11 23:53:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:53:31,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:31,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738077552] [2022-07-11 23:53:31,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738077552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:31,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:31,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526417477] [2022-07-11 23:53:31,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:31,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:31,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:31,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:31,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:31,939 INFO L87 Difference]: Start difference. First operand 307 states and 453 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:32,480 INFO L93 Difference]: Finished difference Result 682 states and 1021 transitions. [2022-07-11 23:53:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-11 23:53:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:32,482 INFO L225 Difference]: With dead ends: 682 [2022-07-11 23:53:32,482 INFO L226 Difference]: Without dead ends: 396 [2022-07-11 23:53:32,483 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-11 23:53:32,483 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 136 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:32,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 354 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:53:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-11 23:53:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 307. [2022-07-11 23:53:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4640522875816993) internal successors, (448), 306 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 448 transitions. [2022-07-11 23:53:32,489 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 448 transitions. Word has length 95 [2022-07-11 23:53:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:32,489 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 448 transitions. [2022-07-11 23:53:32,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 448 transitions. [2022-07-11 23:53:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:53:32,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:32,490 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:32,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:53:32,491 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash 868200130, now seen corresponding path program 1 times [2022-07-11 23:53:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:32,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068074974] [2022-07-11 23:53:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:32,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:53:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:32,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068074974] [2022-07-11 23:53:32,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068074974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:32,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:32,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:32,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928268132] [2022-07-11 23:53:32,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:32,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:32,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:32,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:32,571 INFO L87 Difference]: Start difference. First operand 307 states and 448 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:33,206 INFO L93 Difference]: Finished difference Result 630 states and 922 transitions. [2022-07-11 23:53:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:33,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 99 [2022-07-11 23:53:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:33,209 INFO L225 Difference]: With dead ends: 630 [2022-07-11 23:53:33,209 INFO L226 Difference]: Without dead ends: 344 [2022-07-11 23:53:33,209 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-11 23:53:33,210 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 77 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:33,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 503 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:53:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-11 23:53:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 307. [2022-07-11 23:53:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 306 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 447 transitions. [2022-07-11 23:53:33,215 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 447 transitions. Word has length 99 [2022-07-11 23:53:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:33,215 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 447 transitions. [2022-07-11 23:53:33,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 447 transitions. [2022-07-11 23:53:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:53:33,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:33,216 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:33,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:53:33,216 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash 908874880, now seen corresponding path program 1 times [2022-07-11 23:53:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:33,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854701404] [2022-07-11 23:53:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 23:53:33,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:33,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854701404] [2022-07-11 23:53:33,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854701404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:33,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:33,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:33,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529376588] [2022-07-11 23:53:33,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:33,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:33,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:33,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:33,308 INFO L87 Difference]: Start difference. First operand 307 states and 447 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:33,353 INFO L93 Difference]: Finished difference Result 874 states and 1287 transitions. [2022-07-11 23:53:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:33,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-11 23:53:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:33,355 INFO L225 Difference]: With dead ends: 874 [2022-07-11 23:53:33,355 INFO L226 Difference]: Without dead ends: 588 [2022-07-11 23:53:33,356 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-11 23:53:33,356 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:33,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-11 23:53:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2022-07-11 23:53:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.4565587734241907) internal successors, (855), 587 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 855 transitions. [2022-07-11 23:53:33,367 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 855 transitions. Word has length 99 [2022-07-11 23:53:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:33,367 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 855 transitions. [2022-07-11 23:53:33,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 855 transitions. [2022-07-11 23:53:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:53:33,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:33,368 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:33,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:53:33,369 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1342603966, now seen corresponding path program 1 times [2022-07-11 23:53:33,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:33,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35339492] [2022-07-11 23:53:33,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-11 23:53:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:33,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35339492] [2022-07-11 23:53:33,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35339492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:33,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:33,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464156520] [2022-07-11 23:53:33,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:33,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:33,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:33,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:33,454 INFO L87 Difference]: Start difference. First operand 588 states and 855 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11 23:53:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:33,478 INFO L93 Difference]: Finished difference Result 1182 states and 1722 transitions. [2022-07-11 23:53:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:33,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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 99 [2022-07-11 23:53:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:33,480 INFO L225 Difference]: With dead ends: 1182 [2022-07-11 23:53:33,480 INFO L226 Difference]: Without dead ends: 615 [2022-07-11 23:53:33,481 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-11 23:53:33,482 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:33,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-11 23:53:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-07-11 23:53:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4495114006514658) internal successors, (890), 614 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 890 transitions. [2022-07-11 23:53:33,494 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 890 transitions. Word has length 99 [2022-07-11 23:53:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:33,494 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 890 transitions. [2022-07-11 23:53:33,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11 23:53:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 890 transitions. [2022-07-11 23:53:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:53:33,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:33,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:33,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:53:33,496 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:33,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2113329668, now seen corresponding path program 1 times [2022-07-11 23:53:33,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:33,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127980452] [2022-07-11 23:53:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-11 23:53:33,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127980452] [2022-07-11 23:53:33,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127980452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:33,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:33,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:33,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010811698] [2022-07-11 23:53:33,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:33,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:33,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:33,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:33,570 INFO L87 Difference]: Start difference. First operand 615 states and 890 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:33,588 INFO L93 Difference]: Finished difference Result 1211 states and 1758 transitions. [2022-07-11 23:53:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:33,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-11 23:53:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:33,593 INFO L225 Difference]: With dead ends: 1211 [2022-07-11 23:53:33,593 INFO L226 Difference]: Without dead ends: 617 [2022-07-11 23:53:33,594 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-11 23:53:33,594 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:33,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-11 23:53:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2022-07-11 23:53:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.448051948051948) internal successors, (892), 616 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 892 transitions. [2022-07-11 23:53:33,609 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 892 transitions. Word has length 99 [2022-07-11 23:53:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:33,609 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 892 transitions. [2022-07-11 23:53:33,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 892 transitions. [2022-07-11 23:53:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-11 23:53:33,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:33,610 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:33,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:53:33,611 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -254845290, now seen corresponding path program 1 times [2022-07-11 23:53:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:33,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567889921] [2022-07-11 23:53:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:53:33,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:33,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567889921] [2022-07-11 23:53:33,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567889921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:33,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:33,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064095963] [2022-07-11 23:53:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:33,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:33,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:33,694 INFO L87 Difference]: Start difference. First operand 617 states and 892 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:33,730 INFO L93 Difference]: Finished difference Result 1497 states and 2179 transitions. [2022-07-11 23:53:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-11 23:53:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:33,733 INFO L225 Difference]: With dead ends: 1497 [2022-07-11 23:53:33,733 INFO L226 Difference]: Without dead ends: 903 [2022-07-11 23:53:33,734 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-11 23:53:33,734 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 164 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:33,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 372 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-07-11 23:53:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 901. [2022-07-11 23:53:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.4566666666666668) internal successors, (1311), 900 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1311 transitions. [2022-07-11 23:53:33,752 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1311 transitions. Word has length 101 [2022-07-11 23:53:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:33,753 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1311 transitions. [2022-07-11 23:53:33,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1311 transitions. [2022-07-11 23:53:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:53:33,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:33,754 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:33,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:53:33,754 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 34857145, now seen corresponding path program 1 times [2022-07-11 23:53:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:33,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664646685] [2022-07-11 23:53:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:53:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:33,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664646685] [2022-07-11 23:53:33,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664646685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:33,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:33,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708582984] [2022-07-11 23:53:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:33,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:33,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:33,838 INFO L87 Difference]: Start difference. First operand 901 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-11 23:53:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:33,881 INFO L93 Difference]: Finished difference Result 2065 states and 3015 transitions. [2022-07-11 23:53:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 106 [2022-07-11 23:53:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:33,885 INFO L225 Difference]: With dead ends: 2065 [2022-07-11 23:53:33,885 INFO L226 Difference]: Without dead ends: 1187 [2022-07-11 23:53:33,886 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-11 23:53:33,887 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:33,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-07-11 23:53:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1185. [2022-07-11 23:53:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4493243243243243) internal successors, (1716), 1184 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1716 transitions. [2022-07-11 23:53:33,908 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1716 transitions. Word has length 106 [2022-07-11 23:53:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:33,908 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 1716 transitions. [2022-07-11 23:53:33,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-11 23:53:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1716 transitions. [2022-07-11 23:53:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-11 23:53:33,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:33,910 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-11 23:53:33,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:53:33,910 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -285519407, now seen corresponding path program 1 times [2022-07-11 23:53:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:33,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923179087] [2022-07-11 23:53:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:53:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:33,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923179087] [2022-07-11 23:53:33,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923179087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:33,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:33,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006626730] [2022-07-11 23:53:33,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:33,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:33,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:33,992 INFO L87 Difference]: Start difference. First operand 1185 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-11 23:53:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:34,032 INFO L93 Difference]: Finished difference Result 2626 states and 3817 transitions. [2022-07-11 23:53:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:34,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 123 [2022-07-11 23:53:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:34,036 INFO L225 Difference]: With dead ends: 2626 [2022-07-11 23:53:34,036 INFO L226 Difference]: Without dead ends: 1464 [2022-07-11 23:53:34,037 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-11 23:53:34,038 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:34,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-07-11 23:53:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2022-07-11 23:53:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.4497607655502391) internal successors, (2121), 1463 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2121 transitions. [2022-07-11 23:53:34,065 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2121 transitions. Word has length 123 [2022-07-11 23:53:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:34,065 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 2121 transitions. [2022-07-11 23:53:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-11 23:53:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2121 transitions. [2022-07-11 23:53:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-11 23:53:34,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:34,068 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:34,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:53:34,068 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1271906027, now seen corresponding path program 1 times [2022-07-11 23:53:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:34,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573119878] [2022-07-11 23:53:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:53:34,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:34,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573119878] [2022-07-11 23:53:34,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573119878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:34,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:34,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616425670] [2022-07-11 23:53:34,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:34,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:34,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:34,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:34,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:34,180 INFO L87 Difference]: Start difference. First operand 1464 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:34,225 INFO L93 Difference]: Finished difference Result 1752 states and 2537 transitions. [2022-07-11 23:53:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-11 23:53:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:34,230 INFO L225 Difference]: With dead ends: 1752 [2022-07-11 23:53:34,230 INFO L226 Difference]: Without dead ends: 1750 [2022-07-11 23:53:34,231 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-11 23:53:34,234 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 165 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:34,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 371 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-07-11 23:53:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1748. [2022-07-11 23:53:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.450486548368632) internal successors, (2534), 1747 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2534 transitions. [2022-07-11 23:53:34,281 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2534 transitions. Word has length 129 [2022-07-11 23:53:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:34,281 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2534 transitions. [2022-07-11 23:53:34,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2534 transitions. [2022-07-11 23:53:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-11 23:53:34,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:34,284 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-07-11 23:53:34,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:53:34,285 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1650407178, now seen corresponding path program 1 times [2022-07-11 23:53:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:34,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131931647] [2022-07-11 23:53:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-11 23:53:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131931647] [2022-07-11 23:53:34,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131931647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:34,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:34,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516712561] [2022-07-11 23:53:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:34,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:34,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:34,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:34,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:34,378 INFO L87 Difference]: Start difference. First operand 1748 states and 2534 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:34,425 INFO L93 Difference]: Finished difference Result 3756 states and 5459 transitions. [2022-07-11 23:53:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 166 [2022-07-11 23:53:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:34,431 INFO L225 Difference]: With dead ends: 3756 [2022-07-11 23:53:34,431 INFO L226 Difference]: Without dead ends: 2031 [2022-07-11 23:53:34,433 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-11 23:53:34,433 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 145 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:34,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 573 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2022-07-11 23:53:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2031. [2022-07-11 23:53:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 2030 states have (on average 1.4502463054187191) internal successors, (2944), 2030 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2944 transitions. [2022-07-11 23:53:34,485 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2944 transitions. Word has length 166 [2022-07-11 23:53:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:34,485 INFO L495 AbstractCegarLoop]: Abstraction has 2031 states and 2944 transitions. [2022-07-11 23:53:34,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2944 transitions. [2022-07-11 23:53:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-11 23:53:34,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:34,491 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:34,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:53:34,491 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2051323133, now seen corresponding path program 1 times [2022-07-11 23:53:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:34,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75917485] [2022-07-11 23:53:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:53:34,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:34,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75917485] [2022-07-11 23:53:34,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75917485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:34,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:34,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:34,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454079212] [2022-07-11 23:53:34,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:34,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:34,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:34,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:34,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:34,584 INFO L87 Difference]: Start difference. First operand 2031 states and 2944 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:35,369 INFO L93 Difference]: Finished difference Result 4814 states and 7033 transitions. [2022-07-11 23:53:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 175 [2022-07-11 23:53:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:35,376 INFO L225 Difference]: With dead ends: 4814 [2022-07-11 23:53:35,376 INFO L226 Difference]: Without dead ends: 2806 [2022-07-11 23:53:35,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:35,379 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 106 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:35,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 357 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:53:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2022-07-11 23:53:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2374. [2022-07-11 23:53:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2373 states have (on average 1.4913611462284029) internal successors, (3539), 2373 states have internal predecessors, (3539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3539 transitions. [2022-07-11 23:53:35,431 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3539 transitions. Word has length 175 [2022-07-11 23:53:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:35,431 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 3539 transitions. [2022-07-11 23:53:35,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3539 transitions. [2022-07-11 23:53:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-11 23:53:35,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:35,435 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:35,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:53:35,435 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 84722404, now seen corresponding path program 1 times [2022-07-11 23:53:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:35,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409704920] [2022-07-11 23:53:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:53:35,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409704920] [2022-07-11 23:53:35,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409704920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:35,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:35,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669087749] [2022-07-11 23:53:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:35,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:35,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:35,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:35,548 INFO L87 Difference]: Start difference. First operand 2374 states and 3539 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:35,962 INFO L93 Difference]: Finished difference Result 5242 states and 7796 transitions. [2022-07-11 23:53:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 176 [2022-07-11 23:53:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:35,970 INFO L225 Difference]: With dead ends: 5242 [2022-07-11 23:53:35,970 INFO L226 Difference]: Without dead ends: 2877 [2022-07-11 23:53:35,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:35,973 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 107 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:35,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 370 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:53:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2022-07-11 23:53:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2457. [2022-07-11 23:53:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2456 states have (on average 1.5061074918566775) internal successors, (3699), 2456 states have internal predecessors, (3699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3699 transitions. [2022-07-11 23:53:36,029 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3699 transitions. Word has length 176 [2022-07-11 23:53:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:36,029 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 3699 transitions. [2022-07-11 23:53:36,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3699 transitions. [2022-07-11 23:53:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-11 23:53:36,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:36,033 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:36,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:53:36,033 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:36,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 875181898, now seen corresponding path program 1 times [2022-07-11 23:53:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:36,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322984123] [2022-07-11 23:53:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-11 23:53:36,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:36,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322984123] [2022-07-11 23:53:36,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322984123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:36,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:36,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:36,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732737959] [2022-07-11 23:53:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:36,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:36,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:36,125 INFO L87 Difference]: Start difference. First operand 2457 states and 3699 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:37,133 INFO L93 Difference]: Finished difference Result 5045 states and 7584 transitions. [2022-07-11 23:53:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:37,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 204 [2022-07-11 23:53:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:37,140 INFO L225 Difference]: With dead ends: 5045 [2022-07-11 23:53:37,140 INFO L226 Difference]: Without dead ends: 2611 [2022-07-11 23:53:37,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:37,143 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 41 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:37,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 590 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-11 23:53:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-07-11 23:53:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2457. [2022-07-11 23:53:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2456 states have (on average 1.503257328990228) internal successors, (3692), 2456 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3692 transitions. [2022-07-11 23:53:37,190 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3692 transitions. Word has length 204 [2022-07-11 23:53:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:37,190 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 3692 transitions. [2022-07-11 23:53:37,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3692 transitions. [2022-07-11 23:53:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-11 23:53:37,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:37,194 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:53:37,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-11 23:53:37,194 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1278157357, now seen corresponding path program 1 times [2022-07-11 23:53:37,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:37,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641844668] [2022-07-11 23:53:37,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:37,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 316 proven. 51 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-11 23:53:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641844668] [2022-07-11 23:53:37,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641844668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523346706] [2022-07-11 23:53:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:37,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:37,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:53:37,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:53:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:38,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-11 23:53:38,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:53:38,121 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:38,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:53:38,157 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:53:38,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:53:38,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:53:38,197 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:38,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:53:38,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:53:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 302 proven. 64 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-11 23:53:38,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:53:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-11 23:53:38,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523346706] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:38,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:53:38,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-07-11 23:53:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288637237] [2022-07-11 23:53:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:38,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:53:38,325 INFO L87 Difference]: Start difference. First operand 2457 states and 3692 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:40,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:40,533 INFO L93 Difference]: Finished difference Result 5584 states and 8370 transitions. [2022-07-11 23:53:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:40,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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 226 [2022-07-11 23:53:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:40,541 INFO L225 Difference]: With dead ends: 5584 [2022-07-11 23:53:40,542 INFO L226 Difference]: Without dead ends: 3150 [2022-07-11 23:53:40,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:53:40,544 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 115 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:40,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 384 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:53:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2022-07-11 23:53:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2681. [2022-07-11 23:53:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2680 states have (on average 1.5007462686567163) internal successors, (4022), 2680 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4022 transitions. [2022-07-11 23:53:40,594 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4022 transitions. Word has length 226 [2022-07-11 23:53:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:40,594 INFO L495 AbstractCegarLoop]: Abstraction has 2681 states and 4022 transitions. [2022-07-11 23:53:40,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4022 transitions. [2022-07-11 23:53:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-11 23:53:40,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:40,598 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:40,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:53:40,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-11 23:53:40,812 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1639861597, now seen corresponding path program 1 times [2022-07-11 23:53:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:40,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188527235] [2022-07-11 23:53:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-07-11 23:53:41,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:41,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188527235] [2022-07-11 23:53:41,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188527235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:41,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139055077] [2022-07-11 23:53:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:41,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:41,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:41,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:53:41,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:53:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:41,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 23:53:41,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:53:41,802 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:41,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:53:41,834 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:53:41,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:53:41,848 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 20 treesize of output 8 [2022-07-11 23:53:41,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:53:41,874 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 31 treesize of output 19 [2022-07-11 23:53:41,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:53:41,904 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-11 23:53:41,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-11 23:53:41,969 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-11 23:53:41,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2022-07-11 23:53:42,059 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 29 treesize of output 11 [2022-07-11 23:53:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 140 proven. 101 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-11 23:53:42,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:53:42,107 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 38 treesize of output 26 [2022-07-11 23:53:42,109 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 26 treesize of output 20 [2022-07-11 23:53:42,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (not (= 8545 (select (select (store |c_#memory_int| v_arrayElimCell_14 (store (select |c_#memory_int| v_arrayElimCell_14) (+ 844 v_arrayElimCell_15) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-11 23:53:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-11 23:53:42,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139055077] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:42,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:53:42,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-11 23:53:42,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696518264] [2022-07-11 23:53:42,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:42,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:53:42,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:42,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:53:42,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-11 23:53:42,947 INFO L87 Difference]: Start difference. First operand 2681 states and 4022 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:45,691 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (not (= 8545 (select (select (store |c_#memory_int| v_arrayElimCell_14 (store (select |c_#memory_int| v_arrayElimCell_14) (+ 844 v_arrayElimCell_15) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) (not (= 8545 (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-11 23:53:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:45,780 INFO L93 Difference]: Finished difference Result 6017 states and 8995 transitions. [2022-07-11 23:53:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:53:45,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 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 235 [2022-07-11 23:53:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:45,794 INFO L225 Difference]: With dead ends: 6017 [2022-07-11 23:53:45,794 INFO L226 Difference]: Without dead ends: 3359 [2022-07-11 23:53:45,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-07-11 23:53:45,797 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:45,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 472 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 239 Invalid, 0 Unknown, 268 Unchecked, 0.8s Time] [2022-07-11 23:53:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2022-07-11 23:53:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2861. [2022-07-11 23:53:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 1.4937062937062937) internal successors, (4272), 2860 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4272 transitions. [2022-07-11 23:53:45,864 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4272 transitions. Word has length 235 [2022-07-11 23:53:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:45,864 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 4272 transitions. [2022-07-11 23:53:45,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4272 transitions. [2022-07-11 23:53:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-11 23:53:45,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:45,869 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:45,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:53:46,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-11 23:53:46,090 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 411122401, now seen corresponding path program 1 times [2022-07-11 23:53:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:46,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721156825] [2022-07-11 23:53:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-07-11 23:53:46,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:46,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721156825] [2022-07-11 23:53:46,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721156825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:46,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195958358] [2022-07-11 23:53:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:46,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:53:46,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:53:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:46,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 23:53:47,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:53:47,011 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:47,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:53:47,039 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:53:47,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:53:47,050 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 20 treesize of output 8 [2022-07-11 23:53:47,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:53:47,075 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 31 treesize of output 19 [2022-07-11 23:53:47,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:53:47,094 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-11 23:53:47,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-11 23:53:47,139 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-11 23:53:47,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2022-07-11 23:53:47,220 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 29 treesize of output 11 [2022-07-11 23:53:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 140 proven. 101 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-11 23:53:47,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:53:47,267 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 38 treesize of output 26 [2022-07-11 23:53:47,269 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 26 treesize of output 20 [2022-07-11 23:53:48,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_25 (store (select |c_#memory_int| v_arrayElimCell_25) (+ 844 v_arrayElimCell_26) 3)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8545))) is different from false [2022-07-11 23:53:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-11 23:53:48,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195958358] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:48,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:53:48,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-11 23:53:48,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547540327] [2022-07-11 23:53:48,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:48,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:53:48,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:48,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:53:48,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-11 23:53:48,094 INFO L87 Difference]: Start difference. First operand 2861 states and 4272 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:49,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:51,996 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_25 (store (select |c_#memory_int| v_arrayElimCell_25) (+ 844 v_arrayElimCell_26) 3)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8545))) (not (= 8545 (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-11 23:53:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:52,101 INFO L93 Difference]: Finished difference Result 6371 states and 9483 transitions. [2022-07-11 23:53:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:53:52,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 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 235 [2022-07-11 23:53:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:52,107 INFO L225 Difference]: With dead ends: 6371 [2022-07-11 23:53:52,107 INFO L226 Difference]: Without dead ends: 3533 [2022-07-11 23:53:52,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-07-11 23:53:52,110 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 119 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:52,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 398 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 239 Invalid, 0 Unknown, 194 Unchecked, 1.9s Time] [2022-07-11 23:53:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2022-07-11 23:53:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 2681. [2022-07-11 23:53:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2680 states have (on average 1.4932835820895523) internal successors, (4002), 2680 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4002 transitions. [2022-07-11 23:53:52,156 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4002 transitions. Word has length 235 [2022-07-11 23:53:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:52,157 INFO L495 AbstractCegarLoop]: Abstraction has 2681 states and 4002 transitions. [2022-07-11 23:53:52,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4002 transitions. [2022-07-11 23:53:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-11 23:53:52,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:52,161 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:52,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:53:52,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:52,375 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1613009689, now seen corresponding path program 1 times [2022-07-11 23:53:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:52,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55587628] [2022-07-11 23:53:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 286 proven. 17 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-07-11 23:53:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:52,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55587628] [2022-07-11 23:53:52,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55587628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:52,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32857574] [2022-07-11 23:53:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:52,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:52,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:52,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:53:52,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:53:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:53,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-11 23:53:53,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:53:53,509 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:53,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:53:53,544 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:53:53,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:53:53,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:53,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-11 23:53:53,615 INFO L356 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-07-11 23:53:53,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-07-11 23:53:53,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:53,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-07-11 23:53:54,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:54,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-07-11 23:53:54,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:54,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-07-11 23:53:54,214 INFO L356 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-07-11 23:53:54,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 37 [2022-07-11 23:53:54,252 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 53 treesize of output 35 [2022-07-11 23:53:54,260 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 35 treesize of output 23 [2022-07-11 23:53:54,275 INFO L356 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-07-11 23:53:54,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-07-11 23:53:54,289 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:54,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:53:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-11 23:53:54,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:53:54,796 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 32 treesize of output 20 [2022-07-11 23:53:54,798 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 38 treesize of output 20 [2022-07-11 23:53:54,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:54,869 INFO L356 Elim1Store]: treesize reduction 3, result has 25.0 percent of original size [2022-07-11 23:53:54,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 1 [2022-07-11 23:53:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-11 23:53:54,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32857574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:53:54,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:53:54,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-11 23:53:54,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685879061] [2022-07-11 23:53:54,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:53:54,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-11 23:53:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:54,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-11 23:53:54,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:53:54,874 INFO L87 Difference]: Start difference. First operand 2681 states and 4002 transitions. Second operand has 28 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:59,334 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-11 23:54:02,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:54:06,232 INFO L93 Difference]: Finished difference Result 9218 states and 13547 transitions. [2022-07-11 23:54:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-11 23:54:06,233 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 0 states have call successors, (0), 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 239 [2022-07-11 23:54:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:54:06,242 INFO L225 Difference]: With dead ends: 9218 [2022-07-11 23:54:06,243 INFO L226 Difference]: Without dead ends: 6560 [2022-07-11 23:54:06,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 490 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=614, Invalid=3046, Unknown=0, NotChecked=0, Total=3660 [2022-07-11 23:54:06,248 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 2354 mSDsluCounter, 3250 mSDsCounter, 0 mSdLazyCounter, 3052 mSolverCounterSat, 595 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 3565 SdHoareTripleChecker+Invalid, 4319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 3052 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 671 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:54:06,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 3565 Invalid, 4319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 3052 Invalid, 1 Unknown, 671 Unchecked, 10.5s Time] [2022-07-11 23:54:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2022-07-11 23:54:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 3419. [2022-07-11 23:54:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3418 states have (on average 1.4956114686951434) internal successors, (5112), 3418 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5112 transitions. [2022-07-11 23:54:06,362 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5112 transitions. Word has length 239 [2022-07-11 23:54:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:54:06,362 INFO L495 AbstractCegarLoop]: Abstraction has 3419 states and 5112 transitions. [2022-07-11 23:54:06,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5112 transitions. [2022-07-11 23:54:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-07-11 23:54:06,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:54:06,367 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-11 23:54:06,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:54:06,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-11 23:54:06,587 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:54:06,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:54:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1335983160, now seen corresponding path program 1 times [2022-07-11 23:54:06,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:54:06,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54445847] [2022-07-11 23:54:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:06,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:54:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 291 proven. 2 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-11 23:54:06,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:54:06,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54445847] [2022-07-11 23:54:06,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54445847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:54:06,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785323513] [2022-07-11 23:54:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:06,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:54:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:54:06,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:54:06,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:54:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:07,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-11 23:54:07,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:54:07,690 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:54:07,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:54:07,714 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:54:07,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:54:07,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:54:07,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-11 23:54:07,777 INFO L356 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-07-11 23:54:07,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-07-11 23:54:07,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:54:07,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-07-11 23:54:08,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:54:08,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-07-11 23:54:08,162 INFO L356 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-07-11 23:54:08,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 37 [2022-07-11 23:54:08,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:54:08,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-11 23:54:08,193 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 53 treesize of output 35 [2022-07-11 23:54:08,196 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 35 treesize of output 23 [2022-07-11 23:54:08,210 INFO L356 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-07-11 23:54:08,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-07-11 23:54:08,220 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:54:08,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:54:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-11 23:54:08,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:54:08,653 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 44 treesize of output 26 [2022-07-11 23:54:08,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:54:08,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-11 23:54:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-11 23:54:08,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785323513] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:54:08,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:54:08,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2022-07-11 23:54:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225097527] [2022-07-11 23:54:08,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:54:08,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-11 23:54:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:54:08,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-11 23:54:08,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:54:08,731 INFO L87 Difference]: Start difference. First operand 3419 states and 5112 transitions. Second operand has 25 states, 25 states have (on average 12.04) internal successors, (301), 25 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:10,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:12,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:16,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:54:22,629 INFO L93 Difference]: Finished difference Result 16836 states and 24454 transitions. [2022-07-11 23:54:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-11 23:54:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 12.04) internal successors, (301), 25 states have internal predecessors, (301), 0 states have call successors, (0), 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 240 [2022-07-11 23:54:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:54:22,651 INFO L225 Difference]: With dead ends: 16836 [2022-07-11 23:54:22,651 INFO L226 Difference]: Without dead ends: 13440 [2022-07-11 23:54:22,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 492 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=995, Invalid=3975, Unknown=0, NotChecked=0, Total=4970 [2022-07-11 23:54:22,659 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 2234 mSDsluCounter, 5145 mSDsCounter, 0 mSdLazyCounter, 5018 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 6412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 5018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 922 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:54:22,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2234 Valid, 5634 Invalid, 6412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 5018 Invalid, 0 Unknown, 922 Unchecked, 12.1s Time] [2022-07-11 23:54:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13440 states. [2022-07-11 23:54:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13440 to 3379. [2022-07-11 23:54:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3379 states, 3378 states have (on average 1.4961515689757252) internal successors, (5054), 3378 states have internal predecessors, (5054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5054 transitions. [2022-07-11 23:54:22,849 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5054 transitions. Word has length 240 [2022-07-11 23:54:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:54:22,849 INFO L495 AbstractCegarLoop]: Abstraction has 3379 states and 5054 transitions. [2022-07-11 23:54:22,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.04) internal successors, (301), 25 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5054 transitions. [2022-07-11 23:54:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-11 23:54:22,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:54:22,854 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:54:22,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:54:23,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-11 23:54:23,067 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:54:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:54:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash -961336381, now seen corresponding path program 1 times [2022-07-11 23:54:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:54:23,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178679603] [2022-07-11 23:54:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:54:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 372 proven. 68 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-11 23:54:23,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:54:23,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178679603] [2022-07-11 23:54:23,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178679603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:54:23,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754613332] [2022-07-11 23:54:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:23,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:54:23,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:54:23,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:54:23,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 23:54:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:24,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-11 23:54:24,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:54:24,033 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:54:24,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:54:24,077 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:54:24,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:54:24,102 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 20 treesize of output 8 [2022-07-11 23:54:24,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:54:24,126 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 31 treesize of output 19 [2022-07-11 23:54:24,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:54:24,141 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-11 23:54:24,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-11 23:54:24,185 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-11 23:54:24,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2022-07-11 23:54:24,288 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 29 treesize of output 11 [2022-07-11 23:54:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 363 proven. 68 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-11 23:54:24,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:54:24,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11986 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 84)) v_ArrVal_11986) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8640))) is different from false [2022-07-11 23:54:24,371 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:54:24,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-11 23:54:24,373 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 51 treesize of output 39 [2022-07-11 23:54:24,376 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 8 treesize of output 4 [2022-07-11 23:54:24,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11977 (Array Int Int))) (not (= |c_ULTIMATE.start_ssl3_accept_~s#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 176)) v_ArrVal_11977) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 84))))) is different from false [2022-07-11 23:54:24,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:54:24,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2022-07-11 23:54:24,590 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 38 treesize of output 26 [2022-07-11 23:54:24,592 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 26 treesize of output 20 [2022-07-11 23:54:25,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_76 Int) (v_arrayElimCell_77 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_76 (store (select |c_#memory_int| v_arrayElimCell_76) (+ 844 v_arrayElimCell_77) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))) is different from false [2022-07-11 23:54:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 306 proven. 105 refuted. 0 times theorem prover too weak. 103 trivial. 1 not checked. [2022-07-11 23:54:25,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754613332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:54:25,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:54:25,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2022-07-11 23:54:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740215250] [2022-07-11 23:54:25,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:54:25,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-11 23:54:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:54:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-11 23:54:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=359, Unknown=4, NotChecked=120, Total=552 [2022-07-11 23:54:25,481 INFO L87 Difference]: Start difference. First operand 3379 states and 5054 transitions. Second operand has 24 states, 24 states have (on average 15.875) internal successors, (381), 24 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:27,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:29,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:30,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:33,573 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|))) (and (forall ((v_arrayElimCell_76 Int) (v_arrayElimCell_77 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_76 (store (select |c_#memory_int| v_arrayElimCell_76) (+ 844 v_arrayElimCell_77) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))) (= (select .cse0 (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 64)) 0) (= 8448 (select .cse0 (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-11 23:54:36,053 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_76 Int) (v_arrayElimCell_77 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_76 (store (select |c_#memory_int| v_arrayElimCell_76) (+ 844 v_arrayElimCell_77) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))) (= 8448 (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)))) is different from false [2022-07-11 23:54:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:54:36,192 INFO L93 Difference]: Finished difference Result 10494 states and 15504 transitions. [2022-07-11 23:54:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-11 23:54:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 15.875) internal successors, (381), 24 states have internal predecessors, (381), 0 states have call successors, (0), 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 251 [2022-07-11 23:54:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:54:36,205 INFO L225 Difference]: With dead ends: 10494 [2022-07-11 23:54:36,205 INFO L226 Difference]: Without dead ends: 7138 [2022-07-11 23:54:36,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 510 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=430, Invalid=2236, Unknown=6, NotChecked=520, Total=3192 [2022-07-11 23:54:36,221 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 2608 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2608 SdHoareTripleChecker+Valid, 2941 SdHoareTripleChecker+Invalid, 5467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2675 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:54:36,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2608 Valid, 2941 Invalid, 5467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 2116 Invalid, 0 Unknown, 2675 Unchecked, 7.1s Time] [2022-07-11 23:54:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7138 states. [2022-07-11 23:54:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7138 to 3586. [2022-07-11 23:54:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3585 states have (on average 1.499302649930265) internal successors, (5375), 3585 states have internal predecessors, (5375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5375 transitions. [2022-07-11 23:54:36,356 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5375 transitions. Word has length 251 [2022-07-11 23:54:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:54:36,356 INFO L495 AbstractCegarLoop]: Abstraction has 3586 states and 5375 transitions. [2022-07-11 23:54:36,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 15.875) internal successors, (381), 24 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5375 transitions. [2022-07-11 23:54:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-11 23:54:36,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:54:36,362 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-11 23:54:36,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:54:36,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-11 23:54:36,575 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:54:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:54:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash -14298495, now seen corresponding path program 1 times [2022-07-11 23:54:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:54:36,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979357140] [2022-07-11 23:54:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:36,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:54:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 370 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-11 23:54:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:54:36,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979357140] [2022-07-11 23:54:36,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979357140] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:54:36,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823635314] [2022-07-11 23:54:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:36,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:54:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:54:36,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:54:36,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 23:54:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:37,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-11 23:54:37,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:54:37,578 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:54:37,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:54:37,602 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:54:37,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:54:37,628 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 20 treesize of output 8 [2022-07-11 23:54:37,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:54:37,653 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 31 treesize of output 19 [2022-07-11 23:54:37,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:54:37,670 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-11 23:54:37,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-11 23:54:37,716 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-11 23:54:37,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2022-07-11 23:54:37,818 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 29 treesize of output 11 [2022-07-11 23:54:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 363 proven. 68 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-11 23:54:37,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:54:37,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12615 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 84)) v_ArrVal_12615) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8640))) is different from false [2022-07-11 23:54:37,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:54:37,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-11 23:54:37,898 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 51 treesize of output 39 [2022-07-11 23:54:37,901 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 8 treesize of output 4 [2022-07-11 23:54:37,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12606 (Array Int Int))) (not (= |c_ULTIMATE.start_ssl3_accept_~s#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 176)) v_ArrVal_12606) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 84))))) is different from false [2022-07-11 23:54:38,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:54:38,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2022-07-11 23:54:38,150 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 38 treesize of output 26 [2022-07-11 23:54:38,151 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 26 treesize of output 20 [2022-07-11 23:54:38,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_91 (store (select |c_#memory_int| v_arrayElimCell_91) (+ 844 v_arrayElimCell_92) 3)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))) is different from false [2022-07-11 23:54:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 306 proven. 105 refuted. 0 times theorem prover too weak. 103 trivial. 1 not checked. [2022-07-11 23:54:39,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823635314] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:54:39,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:54:39,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2022-07-11 23:54:39,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36902225] [2022-07-11 23:54:39,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:54:39,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-11 23:54:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:54:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-11 23:54:39,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=398, Unknown=4, NotChecked=126, Total=600 [2022-07-11 23:54:39,005 INFO L87 Difference]: Start difference. First operand 3586 states and 5375 transitions. Second operand has 25 states, 25 states have (on average 15.32) internal successors, (383), 25 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:46,369 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 64)) 0) (= 8448 (select .cse0 (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))) (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_91 (store (select |c_#memory_int| v_arrayElimCell_91) (+ 844 v_arrayElimCell_92) 3)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))))) is different from false [2022-07-11 23:54:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:54:47,414 INFO L93 Difference]: Finished difference Result 10707 states and 15809 transitions. [2022-07-11 23:54:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-11 23:54:47,414 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 15.32) internal successors, (383), 25 states have internal predecessors, (383), 0 states have call successors, (0), 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 251 [2022-07-11 23:54:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:54:47,439 INFO L225 Difference]: With dead ends: 10707 [2022-07-11 23:54:47,439 INFO L226 Difference]: Without dead ends: 7144 [2022-07-11 23:54:47,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 500 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=544, Invalid=2773, Unknown=5, NotChecked=460, Total=3782 [2022-07-11 23:54:47,443 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 2175 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 2284 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 5414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2632 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:54:47,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2175 Valid, 3111 Invalid, 5414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2284 Invalid, 0 Unknown, 2632 Unchecked, 6.3s Time] [2022-07-11 23:54:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7144 states. [2022-07-11 23:54:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7144 to 3386. [2022-07-11 23:54:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.4933530280649927) internal successors, (5055), 3385 states have internal predecessors, (5055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5055 transitions. [2022-07-11 23:54:47,580 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5055 transitions. Word has length 251 [2022-07-11 23:54:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:54:47,581 INFO L495 AbstractCegarLoop]: Abstraction has 3386 states and 5055 transitions. [2022-07-11 23:54:47,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.32) internal successors, (383), 25 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5055 transitions. [2022-07-11 23:54:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-11 23:54:47,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:54:47,586 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:54:47,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:54:47,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:54:47,803 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:54:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:54:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 93515086, now seen corresponding path program 1 times [2022-07-11 23:54:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:54:47,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51355219] [2022-07-11 23:54:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:47,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:54:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-07-11 23:54:47,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:54:47,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51355219] [2022-07-11 23:54:47,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51355219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:54:47,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:54:47,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:54:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008292848] [2022-07-11 23:54:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:54:47,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:54:47,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:54:47,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:54:47,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:54:47,990 INFO L87 Difference]: Start difference. First operand 3386 states and 5055 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:50,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:54:51,632 INFO L93 Difference]: Finished difference Result 8862 states and 13053 transitions. [2022-07-11 23:54:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:54:51,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 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 252 [2022-07-11 23:54:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:54:51,638 INFO L225 Difference]: With dead ends: 8862 [2022-07-11 23:54:51,638 INFO L226 Difference]: Without dead ends: 5499 [2022-07-11 23:54:51,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:54:51,641 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 503 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:54:51,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1193 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-11 23:54:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2022-07-11 23:54:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 3386. [2022-07-11 23:54:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.491285081240768) internal successors, (5048), 3385 states have internal predecessors, (5048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5048 transitions. [2022-07-11 23:54:51,768 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5048 transitions. Word has length 252 [2022-07-11 23:54:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:54:51,768 INFO L495 AbstractCegarLoop]: Abstraction has 3386 states and 5048 transitions. [2022-07-11 23:54:51,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5048 transitions. [2022-07-11 23:54:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-11 23:54:51,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:54:51,773 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:54:51,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-11 23:54:51,773 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:54:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:54:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash -613081520, now seen corresponding path program 1 times [2022-07-11 23:54:51,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:54:51,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518065011] [2022-07-11 23:54:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:54:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-11 23:54:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:54:51,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518065011] [2022-07-11 23:54:51,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518065011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:54:51,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:54:51,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:54:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317346018] [2022-07-11 23:54:51,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:54:51,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:54:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:54:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:54:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:54:51,952 INFO L87 Difference]: Start difference. First operand 3386 states and 5048 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:54,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:54:56,028 INFO L93 Difference]: Finished difference Result 9526 states and 14059 transitions. [2022-07-11 23:54:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:54:56,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 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 252 [2022-07-11 23:54:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:54:56,034 INFO L225 Difference]: With dead ends: 9526 [2022-07-11 23:54:56,034 INFO L226 Difference]: Without dead ends: 6139 [2022-07-11 23:54:56,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:54:56,036 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 505 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:54:56,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1223 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-11 23:54:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6139 states. [2022-07-11 23:54:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6139 to 3826. [2022-07-11 23:54:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3826 states, 3825 states have (on average 1.4972549019607844) internal successors, (5727), 3825 states have internal predecessors, (5727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5727 transitions. [2022-07-11 23:54:56,188 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5727 transitions. Word has length 252 [2022-07-11 23:54:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:54:56,188 INFO L495 AbstractCegarLoop]: Abstraction has 3826 states and 5727 transitions. [2022-07-11 23:54:56,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5727 transitions. [2022-07-11 23:54:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-11 23:54:56,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:54:56,193 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2022-07-11 23:54:56,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-11 23:54:56,194 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:54:56,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:54:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1799400237, now seen corresponding path program 1 times [2022-07-11 23:54:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:54:56,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39720796] [2022-07-11 23:54:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:56,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:54:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2022-07-11 23:54:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:54:56,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39720796] [2022-07-11 23:54:56,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39720796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:54:56,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:54:56,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:54:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40437619] [2022-07-11 23:54:56,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:54:56,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:54:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:54:56,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:54:56,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:54:56,301 INFO L87 Difference]: Start difference. First operand 3826 states and 5727 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:54:56,909 INFO L93 Difference]: Finished difference Result 7909 states and 11822 transitions. [2022-07-11 23:54:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:54:56,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 262 [2022-07-11 23:54:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:54:56,914 INFO L225 Difference]: With dead ends: 7909 [2022-07-11 23:54:56,914 INFO L226 Difference]: Without dead ends: 4106 [2022-07-11 23:54:56,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:54:56,917 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 30 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:54:56,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 577 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:54:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2022-07-11 23:54:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4008. [2022-07-11 23:54:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4007 states have (on average 1.4956326428749689) internal successors, (5993), 4007 states have internal predecessors, (5993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5993 transitions. [2022-07-11 23:54:57,059 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5993 transitions. Word has length 262 [2022-07-11 23:54:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:54:57,059 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 5993 transitions. [2022-07-11 23:54:57,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5993 transitions. [2022-07-11 23:54:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-11 23:54:57,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:54:57,065 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:54:57,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-11 23:54:57,065 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:54:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:54:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1317501989, now seen corresponding path program 1 times [2022-07-11 23:54:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:54:57,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410701009] [2022-07-11 23:54:57,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:54:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-11 23:54:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:54:57,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410701009] [2022-07-11 23:54:57,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410701009] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:54:57,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720105403] [2022-07-11 23:54:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:54:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:54:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:54:57,303 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:54:57,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 23:54:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:54:58,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 23:54:58,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:54:58,150 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:54:58,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:54:58,173 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:54:58,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:54:58,183 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 20 treesize of output 8 [2022-07-11 23:54:58,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:54:58,197 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 31 treesize of output 19 [2022-07-11 23:54:58,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:54:58,212 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-11 23:54:58,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-11 23:54:58,250 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-11 23:54:58,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2022-07-11 23:54:58,311 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 29 treesize of output 11 [2022-07-11 23:54:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 299 proven. 104 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-11 23:54:58,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:54:58,346 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 38 treesize of output 26 [2022-07-11 23:54:58,347 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 26 treesize of output 20 [2022-07-11 23:54:59,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_102 (store (select |c_#memory_int| v_arrayElimCell_102) (+ v_arrayElimCell_103 844) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8528))) is different from false [2022-07-11 23:54:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-11 23:54:59,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720105403] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:54:59,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:54:59,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-11 23:54:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553030316] [2022-07-11 23:54:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:54:59,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:54:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:54:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:54:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-11 23:54:59,926 INFO L87 Difference]: Start difference. First operand 4008 states and 5993 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:01,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:03,012 WARN L833 $PredicateComparison]: unable to prove that (and (not (= 8528 (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)))) (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_102 (store (select |c_#memory_int| v_arrayElimCell_102) (+ v_arrayElimCell_103 844) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8528)))) is different from false [2022-07-11 23:55:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:03,187 INFO L93 Difference]: Finished difference Result 8625 states and 12851 transitions. [2022-07-11 23:55:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:55:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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 262 [2022-07-11 23:55:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:03,192 INFO L225 Difference]: With dead ends: 8625 [2022-07-11 23:55:03,192 INFO L226 Difference]: Without dead ends: 4640 [2022-07-11 23:55:03,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-07-11 23:55:03,194 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:03,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 400 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 240 Invalid, 0 Unknown, 192 Unchecked, 1.9s Time] [2022-07-11 23:55:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-11 23:55:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4170. [2022-07-11 23:55:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4169 states have (on average 1.480690813144639) internal successors, (6173), 4169 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6173 transitions. [2022-07-11 23:55:03,334 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6173 transitions. Word has length 262 [2022-07-11 23:55:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:03,334 INFO L495 AbstractCegarLoop]: Abstraction has 4170 states and 6173 transitions. [2022-07-11 23:55:03,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6173 transitions. [2022-07-11 23:55:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-11 23:55:03,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:03,339 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:03,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:03,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-07-11 23:55:03,540 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:03,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:03,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1015890649, now seen corresponding path program 1 times [2022-07-11 23:55:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:03,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428680901] [2022-07-11 23:55:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:03,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-11 23:55:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428680901] [2022-07-11 23:55:03,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428680901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:55:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724609469] [2022-07-11 23:55:03,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:03,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:55:03,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:55:03,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:55:03,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-11 23:55:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:04,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-11 23:55:04,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:04,668 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:55:04,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:55:04,694 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:55:04,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:55:04,710 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 20 treesize of output 8 [2022-07-11 23:55:04,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:55:04,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:55:04,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:55:04,729 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 31 treesize of output 19 [2022-07-11 23:55:04,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:55:04,745 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-11 23:55:04,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-11 23:55:04,799 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-11 23:55:04,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2022-07-11 23:55:04,908 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 29 treesize of output 11 [2022-07-11 23:55:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 299 proven. 104 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-11 23:55:04,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:55:04,948 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 38 treesize of output 32 [2022-07-11 23:55:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-11 23:55:04,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724609469] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:55:04,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:55:04,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 10] total 12 [2022-07-11 23:55:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379149584] [2022-07-11 23:55:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:04,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:55:04,965 INFO L87 Difference]: Start difference. First operand 4170 states and 6173 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:05,664 INFO L93 Difference]: Finished difference Result 8711 states and 12847 transitions. [2022-07-11 23:55:05,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:05,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 262 [2022-07-11 23:55:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:05,669 INFO L225 Difference]: With dead ends: 8711 [2022-07-11 23:55:05,670 INFO L226 Difference]: Without dead ends: 4564 [2022-07-11 23:55:05,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 521 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:55:05,673 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:05,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 372 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:55:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2022-07-11 23:55:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4008. [2022-07-11 23:55:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4007 states have (on average 1.4794110306962815) internal successors, (5928), 4007 states have internal predecessors, (5928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5928 transitions. [2022-07-11 23:55:05,857 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5928 transitions. Word has length 262 [2022-07-11 23:55:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:05,857 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 5928 transitions. [2022-07-11 23:55:05,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5928 transitions. [2022-07-11 23:55:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-11 23:55:05,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:05,863 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:55:05,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-11 23:55:06,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:55:06,082 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash -107756293, now seen corresponding path program 1 times [2022-07-11 23:55:06,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:06,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023415477] [2022-07-11 23:55:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 339 proven. 297 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-11 23:55:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023415477] [2022-07-11 23:55:06,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023415477] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:55:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718625393] [2022-07-11 23:55:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:06,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:55:06,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:55:06,904 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:55:06,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 23:55:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:07,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 23:55:07,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:07,807 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:55:07,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:55:07,834 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:55:07,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-07-11 23:55:07,853 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 20 treesize of output 8 [2022-07-11 23:55:07,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:55:07,880 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 31 treesize of output 19 [2022-07-11 23:55:07,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:55:07,895 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-11 23:55:07,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-11 23:55:07,938 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-11 23:55:07,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2022-07-11 23:55:08,005 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 29 treesize of output 11 [2022-07-11 23:55:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 301 proven. 103 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-11 23:55:08,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:55:08,054 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 38 treesize of output 26 [2022-07-11 23:55:08,056 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 26 treesize of output 20 [2022-07-11 23:55:08,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_124 Int) (v_arrayElimCell_123 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_123 (store (select |c_#memory_int| v_arrayElimCell_123) (+ v_arrayElimCell_124 844) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8529))) is different from false [2022-07-11 23:55:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-11 23:55:08,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718625393] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:55:08,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:55:08,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 10] total 22 [2022-07-11 23:55:08,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710760452] [2022-07-11 23:55:08,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:08,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:55:08,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:08,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:55:08,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2022-07-11 23:55:08,989 INFO L87 Difference]: Start difference. First operand 4008 states and 5928 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:11,888 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8529)) (forall ((v_arrayElimCell_124 Int) (v_arrayElimCell_123 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_123 (store (select |c_#memory_int| v_arrayElimCell_123) (+ v_arrayElimCell_124 844) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8529)))) is different from false [2022-07-11 23:55:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:12,134 INFO L93 Difference]: Finished difference Result 8625 states and 12715 transitions. [2022-07-11 23:55:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:55:12,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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 263 [2022-07-11 23:55:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:12,139 INFO L225 Difference]: With dead ends: 8625 [2022-07-11 23:55:12,140 INFO L226 Difference]: Without dead ends: 4640 [2022-07-11 23:55:12,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=69, Invalid=399, Unknown=2, NotChecked=82, Total=552 [2022-07-11 23:55:12,143 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 120 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:12,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 400 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 239 Invalid, 0 Unknown, 192 Unchecked, 0.9s Time] [2022-07-11 23:55:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-11 23:55:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4176. [2022-07-11 23:55:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4175 states have (on average 1.464431137724551) internal successors, (6114), 4175 states have internal predecessors, (6114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6114 transitions. [2022-07-11 23:55:12,294 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6114 transitions. Word has length 263 [2022-07-11 23:55:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:12,294 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 6114 transitions. [2022-07-11 23:55:12,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6114 transitions. [2022-07-11 23:55:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-11 23:55:12,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:12,299 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:12,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:12,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-11 23:55:12,509 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash -830624380, now seen corresponding path program 1 times [2022-07-11 23:55:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:12,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123506254] [2022-07-11 23:55:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:12,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-11 23:55:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:12,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123506254] [2022-07-11 23:55:12,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123506254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:12,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:12,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:55:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795137012] [2022-07-11 23:55:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:12,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:55:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:12,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:55:12,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:12,903 INFO L87 Difference]: Start difference. First operand 4176 states and 6114 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:14,311 INFO L93 Difference]: Finished difference Result 8349 states and 12224 transitions. [2022-07-11 23:55:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:55:14,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 263 [2022-07-11 23:55:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:14,319 INFO L225 Difference]: With dead ends: 8349 [2022-07-11 23:55:14,319 INFO L226 Difference]: Without dead ends: 4176 [2022-07-11 23:55:14,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:55:14,323 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:14,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:55:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2022-07-11 23:55:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 4176. [2022-07-11 23:55:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4175 states have (on average 1.464191616766467) internal successors, (6113), 4175 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6113 transitions. [2022-07-11 23:55:14,464 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6113 transitions. Word has length 263 [2022-07-11 23:55:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:14,464 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 6113 transitions. [2022-07-11 23:55:14,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6113 transitions. [2022-07-11 23:55:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-11 23:55:14,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:14,470 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:14,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-11 23:55:14,470 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1001757830, now seen corresponding path program 1 times [2022-07-11 23:55:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:14,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26704606] [2022-07-11 23:55:14,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 457 proven. 186 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 23:55:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:15,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26704606] [2022-07-11 23:55:15,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26704606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:55:15,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741430026] [2022-07-11 23:55:15,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:15,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:55:15,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:55:15,222 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:55:15,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 23:55:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:16,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-11 23:55:16,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:16,404 INFO L356 Elim1Store]: treesize reduction 71, result has 37.7 percent of original size [2022-07-11 23:55:16,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 230 [2022-07-11 23:55:16,761 INFO L356 Elim1Store]: treesize reduction 126, result has 49.0 percent of original size [2022-07-11 23:55:16,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 236 treesize of output 569 [2022-07-11 23:55:16,901 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-11 23:55:16,902 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-11 23:55:16,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:17,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-11 23:55:17,103 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_752| input size 161 context size 161 output size 161 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-11 23:55:17,106 INFO L158 Benchmark]: Toolchain (without parser) took 128443.19ms. Allocated memory was 102.8MB in the beginning and 553.6MB in the end (delta: 450.9MB). Free memory was 65.5MB in the beginning and 195.0MB in the end (delta: -129.5MB). Peak memory consumption was 322.8MB. Max. memory is 16.1GB. [2022-07-11 23:55:17,107 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory was 47.7MB in the beginning and 47.7MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:55:17,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.81ms. Allocated memory is still 102.8MB. Free memory was 65.3MB in the beginning and 57.8MB in the end (delta: 7.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 23:55:17,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.75ms. Allocated memory is still 102.8MB. Free memory was 57.8MB in the beginning and 52.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:55:17,107 INFO L158 Benchmark]: Boogie Preprocessor took 76.56ms. Allocated memory is still 102.8MB. Free memory was 52.7MB in the beginning and 45.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:55:17,107 INFO L158 Benchmark]: RCFGBuilder took 1153.80ms. Allocated memory is still 102.8MB. Free memory was 45.2MB in the beginning and 44.6MB in the end (delta: 603.8kB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-07-11 23:55:17,107 INFO L158 Benchmark]: TraceAbstraction took 126673.35ms. Allocated memory was 102.8MB in the beginning and 553.6MB in the end (delta: 450.9MB). Free memory was 43.9MB in the beginning and 195.0MB in the end (delta: -151.1MB). Peak memory consumption was 301.0MB. Max. memory is 16.1GB. [2022-07-11 23:55:17,107 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory was 47.7MB in the beginning and 47.7MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.81ms. Allocated memory is still 102.8MB. Free memory was 65.3MB in the beginning and 57.8MB in the end (delta: 7.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.75ms. Allocated memory is still 102.8MB. Free memory was 57.8MB in the beginning and 52.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.56ms. Allocated memory is still 102.8MB. Free memory was 52.7MB in the beginning and 45.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1153.80ms. Allocated memory is still 102.8MB. Free memory was 45.2MB in the beginning and 44.6MB in the end (delta: 603.8kB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 126673.35ms. Allocated memory was 102.8MB in the beginning and 553.6MB in the end (delta: 450.9MB). Free memory was 43.9MB in the beginning and 195.0MB in the end (delta: -151.1MB). Peak memory consumption was 301.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_752| input size 161 context size 161 output size 161 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_752| input size 161 context size 161 output size 161: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-11 23:55:17,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.09.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 7b66a12741a993de3de45354c2fb746af1f1a44b9ceb94bb607376650a8088af --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:55:18,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:55:18,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:55:18,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:55:18,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:55:18,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:55:18,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:55:18,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:55:18,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:55:18,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:55:18,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:55:18,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:55:18,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:55:18,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:55:18,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:55:18,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:55:18,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:55:18,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:55:18,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:55:18,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:55:18,843 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:55:18,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:55:18,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:55:18,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:55:18,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:55:18,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:55:18,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:55:18,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:55:18,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:55:18,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:55:18,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:55:18,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:55:18,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:55:18,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:55:18,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:55:18,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:55:18,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:55:18,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:55:18,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:55:18,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:55:18,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:55:18,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:55:18,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-11 23:55:18,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:55:18,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:55:18,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:55:18,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:55:18,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:55:18,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:55:18,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:55:18,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:55:18,894 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:55:18,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:55:18,895 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:55:18,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:55:18,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:55:18,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:55:18,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:55:18,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:55:18,903 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-11 23:55:18,903 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-11 23:55:18,903 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-11 23:55:18,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:55:18,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:55:18,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:55:18,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:55:18,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:55:18,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:55:18,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:55:18,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:55:18,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:55:18,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:55:18,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:55:18,906 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-11 23:55:18,906 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-11 23:55:18,906 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:55:18,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:55:18,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:55:18,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-11 23:55:18,907 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 -> 7b66a12741a993de3de45354c2fb746af1f1a44b9ceb94bb607376650a8088af [2022-07-11 23:55:19,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:55:19,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:55:19,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:55:19,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:55:19,178 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:55:19,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-11 23:55:19,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edbcf5c48/7294f8c8692342bfb9c6cbe08651c161/FLAG747476be1 [2022-07-11 23:55:19,671 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:55:19,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-11 23:55:19,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edbcf5c48/7294f8c8692342bfb9c6cbe08651c161/FLAG747476be1 [2022-07-11 23:55:19,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edbcf5c48/7294f8c8692342bfb9c6cbe08651c161 [2022-07-11 23:55:19,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:55:19,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:55:19,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:55:19,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:55:19,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:55:19,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:55:19" (1/1) ... [2022-07-11 23:55:19,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f30fdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:19, skipping insertion in model container [2022-07-11 23:55:19,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:55:19" (1/1) ... [2022-07-11 23:55:19,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:55:19,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:55:20,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-11 23:55:20,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:55:20,060 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-11 23:55:20,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:55:20,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-11 23:55:20,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:55:20,154 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:55:20,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-11 23:55:20,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:55:20,287 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:55:20,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20 WrapperNode [2022-07-11 23:55:20,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:55:20,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:55:20,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:55:20,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:55:20,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,355 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 762 [2022-07-11 23:55:20,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:55:20,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:55:20,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:55:20,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:55:20,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:55:20,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:55:20,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:55:20,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:55:20,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (1/1) ... [2022-07-11 23:55:20,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:55:20,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:55:20,471 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-11 23:55:20,501 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-11 23:55:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:55:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:55:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:55:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-11 23:55:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:55:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:55:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:55:20,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:55:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-11 23:55:20,665 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:55:20,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:55:20,682 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:55:28,036 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:55:28,037 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:55:28,037 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:55:28,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:55:28,042 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:55:28,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:55:28 BoogieIcfgContainer [2022-07-11 23:55:28,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:55:28,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:55:28,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:55:28,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:55:28,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:55:19" (1/3) ... [2022-07-11 23:55:28,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebfcab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:55:28, skipping insertion in model container [2022-07-11 23:55:28,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:20" (2/3) ... [2022-07-11 23:55:28,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebfcab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:55:28, skipping insertion in model container [2022-07-11 23:55:28,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:55:28" (3/3) ... [2022-07-11 23:55:28,051 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2022-07-11 23:55:28,060 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:55:28,061 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:55:28,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:55:28,116 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@cc6bfd1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a7e06b3 [2022-07-11 23:55:28,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:55:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:55:28,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:28,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:28,129 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:28,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:28,136 INFO L85 PathProgramCache]: Analyzing trace with hash -442385418, now seen corresponding path program 1 times [2022-07-11 23:55:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:28,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422914291] [2022-07-11 23:55:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:28,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:28,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:28,151 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-11 23:55:28,179 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-11 23:55:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:28,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:55:28,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:28,748 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-11 23:55:28,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:28,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:28,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422914291] [2022-07-11 23:55:28,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422914291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:28,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:28,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:55:28,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746304644] [2022-07-11 23:55:28,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:28,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:55:28,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:28,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:55:28,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:28,793 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:28,894 INFO L93 Difference]: Finished difference Result 427 states and 728 transitions. [2022-07-11 23:55:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:55:28,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-11 23:55:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:28,914 INFO L225 Difference]: With dead ends: 427 [2022-07-11 23:55:28,914 INFO L226 Difference]: Without dead ends: 261 [2022-07-11 23:55:28,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:28,919 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:28,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 461 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:55:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-11 23:55:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-07-11 23:55:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5153846153846153) internal successors, (394), 260 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2022-07-11 23:55:28,960 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 37 [2022-07-11 23:55:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:28,961 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2022-07-11 23:55:28,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2022-07-11 23:55:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:55:28,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:28,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:28,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:29,180 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-11 23:55:29,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash 242366870, now seen corresponding path program 1 times [2022-07-11 23:55:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:29,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499679933] [2022-07-11 23:55:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:29,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:29,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:29,183 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-11 23:55:29,184 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-11 23:55:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:29,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:55:29,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:29,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:29,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:29,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499679933] [2022-07-11 23:55:29,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499679933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:29,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:29,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:55:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520494728] [2022-07-11 23:55:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:29,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:55:29,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:29,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:55:29,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:29,774 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:30,699 INFO L93 Difference]: Finished difference Result 510 states and 781 transitions. [2022-07-11 23:55:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:55:30,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-11 23:55:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:30,702 INFO L225 Difference]: With dead ends: 510 [2022-07-11 23:55:30,702 INFO L226 Difference]: Without dead ends: 383 [2022-07-11 23:55:30,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:30,703 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:30,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:55:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-11 23:55:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2022-07-11 23:55:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5052356020942408) internal successors, (575), 382 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 575 transitions. [2022-07-11 23:55:30,729 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 575 transitions. Word has length 54 [2022-07-11 23:55:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:30,730 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 575 transitions. [2022-07-11 23:55:30,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 575 transitions. [2022-07-11 23:55:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-11 23:55:30,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:30,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:30,757 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-11 23:55:30,955 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-11 23:55:30,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1040793707, now seen corresponding path program 1 times [2022-07-11 23:55:30,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:30,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360495527] [2022-07-11 23:55:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:30,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:30,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:30,958 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-11 23:55:30,965 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-11 23:55:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:31,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:55:31,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:55:31,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:31,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:31,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360495527] [2022-07-11 23:55:31,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360495527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:31,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:31,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:55:31,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332419255] [2022-07-11 23:55:31,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:31,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:55:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:31,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:55:31,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:31,547 INFO L87 Difference]: Start difference. First operand 383 states and 575 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:32,453 INFO L93 Difference]: Finished difference Result 754 states and 1144 transitions. [2022-07-11 23:55:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:55:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-07-11 23:55:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:32,455 INFO L225 Difference]: With dead ends: 754 [2022-07-11 23:55:32,455 INFO L226 Difference]: Without dead ends: 505 [2022-07-11 23:55:32,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:32,457 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:32,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:55:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-11 23:55:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2022-07-11 23:55:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.501984126984127) internal successors, (757), 504 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 757 transitions. [2022-07-11 23:55:32,479 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 757 transitions. Word has length 76 [2022-07-11 23:55:32,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:32,479 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 757 transitions. [2022-07-11 23:55:32,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 757 transitions. [2022-07-11 23:55:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-11 23:55:32,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:32,483 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:32,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:32,697 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-11 23:55:32,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:32,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:32,698 INFO L85 PathProgramCache]: Analyzing trace with hash -792001576, now seen corresponding path program 1 times [2022-07-11 23:55:32,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:32,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197027534] [2022-07-11 23:55:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:32,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:32,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:32,701 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-11 23:55:32,702 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-11 23:55:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:33,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:55:33,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:55:33,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:33,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:33,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197027534] [2022-07-11 23:55:33,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197027534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:33,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:33,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:55:33,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757974223] [2022-07-11 23:55:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:33,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:55:33,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:33,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:55:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:33,349 INFO L87 Difference]: Start difference. First operand 505 states and 757 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:33,903 INFO L93 Difference]: Finished difference Result 1000 states and 1510 transitions. [2022-07-11 23:55:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:55:33,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-11 23:55:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:33,906 INFO L225 Difference]: With dead ends: 1000 [2022-07-11 23:55:33,906 INFO L226 Difference]: Without dead ends: 629 [2022-07-11 23:55:33,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:33,907 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:33,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 572 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:55:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-07-11 23:55:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2022-07-11 23:55:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4984076433121019) internal successors, (941), 628 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 941 transitions. [2022-07-11 23:55:33,919 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 941 transitions. Word has length 100 [2022-07-11 23:55:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:33,920 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 941 transitions. [2022-07-11 23:55:33,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 941 transitions. [2022-07-11 23:55:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-11 23:55:33,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:33,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:33,943 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-11 23:55:34,135 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-11 23:55:34,136 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:34,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -483706638, now seen corresponding path program 1 times [2022-07-11 23:55:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:34,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856576669] [2022-07-11 23:55:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:34,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:34,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:34,138 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-11 23:55:34,141 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-11 23:55:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:34,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:55:34,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:55:34,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:34,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:34,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856576669] [2022-07-11 23:55:34,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856576669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:34,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:34,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:55:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645941974] [2022-07-11 23:55:34,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:34,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:55:34,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:34,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:55:34,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:34,778 INFO L87 Difference]: Start difference. First operand 629 states and 941 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:35,336 INFO L93 Difference]: Finished difference Result 1244 states and 1871 transitions. [2022-07-11 23:55:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:55:35,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-11 23:55:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:35,339 INFO L225 Difference]: With dead ends: 1244 [2022-07-11 23:55:35,339 INFO L226 Difference]: Without dead ends: 749 [2022-07-11 23:55:35,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:35,340 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 147 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:35,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 569 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:55:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-07-11 23:55:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2022-07-11 23:55:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 1.4973262032085561) internal successors, (1120), 748 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1120 transitions. [2022-07-11 23:55:35,353 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1120 transitions. Word has length 117 [2022-07-11 23:55:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:35,353 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1120 transitions. [2022-07-11 23:55:35,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1120 transitions. [2022-07-11 23:55:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-11 23:55:35,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:35,355 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:35,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-11 23:55:35,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:55:35,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash 686668759, now seen corresponding path program 1 times [2022-07-11 23:55:35,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:35,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662087844] [2022-07-11 23:55:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:35,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:35,576 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:55:35,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-11 23:55:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:36,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:55:36,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:55:36,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:36,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:36,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662087844] [2022-07-11 23:55:36,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662087844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:36,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:36,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:55:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710962869] [2022-07-11 23:55:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:36,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:55:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:36,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:55:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:36,277 INFO L87 Difference]: Start difference. First operand 749 states and 1120 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:36,963 INFO L93 Difference]: Finished difference Result 1486 states and 2233 transitions. [2022-07-11 23:55:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:55:36,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-11 23:55:36,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:36,967 INFO L225 Difference]: With dead ends: 1486 [2022-07-11 23:55:36,967 INFO L226 Difference]: Without dead ends: 871 [2022-07-11 23:55:36,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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-11 23:55:36,969 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 149 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:36,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:55:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-07-11 23:55:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2022-07-11 23:55:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.4954022988505746) internal successors, (1301), 870 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1301 transitions. [2022-07-11 23:55:36,992 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1301 transitions. Word has length 129 [2022-07-11 23:55:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:36,992 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1301 transitions. [2022-07-11 23:55:36,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1301 transitions. [2022-07-11 23:55:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-11 23:55:36,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:36,995 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:55:37,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:37,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:55:37,215 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1815233301, now seen corresponding path program 1 times [2022-07-11 23:55:37,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:37,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133901930] [2022-07-11 23:55:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:37,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:37,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:37,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:55:37,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-11 23:55:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:37,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:55:37,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-11 23:55:37,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:37,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:37,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133901930] [2022-07-11 23:55:37,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133901930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:37,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:37,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:55:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467391565] [2022-07-11 23:55:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:37,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:55:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:37,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:55:37,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:55:37,976 INFO L87 Difference]: Start difference. First operand 871 states and 1301 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:38,820 INFO L93 Difference]: Finished difference Result 1732 states and 2597 transitions. [2022-07-11 23:55:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:55:38,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-07-11 23:55:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:38,824 INFO L225 Difference]: With dead ends: 1732 [2022-07-11 23:55:38,824 INFO L226 Difference]: Without dead ends: 995 [2022-07-11 23:55:38,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 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-11 23:55:38,826 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 151 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:38,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 573 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:55:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-11 23:55:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2022-07-11 23:55:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.4939637826961771) internal successors, (1485), 994 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1485 transitions. [2022-07-11 23:55:38,842 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1485 transitions. Word has length 160 [2022-07-11 23:55:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:38,842 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1485 transitions. [2022-07-11 23:55:38,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1485 transitions. [2022-07-11 23:55:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-11 23:55:38,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:38,845 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:38,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:39,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:55:39,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2092203957, now seen corresponding path program 1 times [2022-07-11 23:55:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:39,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144695085] [2022-07-11 23:55:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:39,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:39,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:39,084 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:55:39,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-11 23:55:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:40,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 23:55:40,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:40,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:55:40,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:55:41,054 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-11 23:55:41,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 85 [2022-07-11 23:55:41,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2022-07-11 23:55:41,257 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:55:41,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:55:41,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:41,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:55:41,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:55:41,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:55:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-11 23:55:41,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:41,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:41,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144695085] [2022-07-11 23:55:41,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144695085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:41,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:41,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:55:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165725902] [2022-07-11 23:55:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:41,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:55:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:41,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:55:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:41,319 INFO L87 Difference]: Start difference. First operand 995 states and 1485 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:43,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:45,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:53,684 INFO L93 Difference]: Finished difference Result 1987 states and 2966 transitions. [2022-07-11 23:55:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:55:53,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-07-11 23:55:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:53,695 INFO L225 Difference]: With dead ends: 1987 [2022-07-11 23:55:53,696 INFO L226 Difference]: Without dead ends: 995 [2022-07-11 23:55:53,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:55:53,697 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:53,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 12.3s Time] [2022-07-11 23:55:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-11 23:55:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2022-07-11 23:55:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.4929577464788732) internal successors, (1484), 994 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1484 transitions. [2022-07-11 23:55:53,714 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1484 transitions. Word has length 174 [2022-07-11 23:55:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:53,715 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1484 transitions. [2022-07-11 23:55:53,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1484 transitions. [2022-07-11 23:55:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-11 23:55:53,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:53,718 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:53,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:53,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:55:53,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash 834302729, now seen corresponding path program 1 times [2022-07-11 23:55:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:55:53,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149066829] [2022-07-11 23:55:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:53,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:55:53,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:55:53,942 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:55:53,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-11 23:55:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:55,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:55:55,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:55,676 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-11 23:55:55,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-11 23:55:55,792 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:55:55,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-11 23:55:55,865 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:55:55,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-11 23:55:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-11 23:55:55,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:55:55,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:55:55,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149066829] [2022-07-11 23:55:55,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149066829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:55,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:55,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:55,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029076277] [2022-07-11 23:55:55,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:55,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:55,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:55:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:55,889 INFO L87 Difference]: Start difference. First operand 995 states and 1484 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:57,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:59,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:03,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:05,265 INFO L93 Difference]: Finished difference Result 2352 states and 3512 transitions. [2022-07-11 23:56:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:05,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 174 [2022-07-11 23:56:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:05,271 INFO L225 Difference]: With dead ends: 2352 [2022-07-11 23:56:05,271 INFO L226 Difference]: Without dead ends: 1367 [2022-07-11 23:56:05,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 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-11 23:56:05,273 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:05,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 590 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 1 Unknown, 41 Unchecked, 9.3s Time] [2022-07-11 23:56:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-11 23:56:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1202. [2022-07-11 23:56:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1201 states have (on average 1.52789342214821) internal successors, (1835), 1201 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1835 transitions. [2022-07-11 23:56:05,293 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1835 transitions. Word has length 174 [2022-07-11 23:56:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:05,294 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1835 transitions. [2022-07-11 23:56:05,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1835 transitions. [2022-07-11 23:56:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-11 23:56:05,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:05,296 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:05,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-11 23:56:05,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:56:05,515 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash 289430155, now seen corresponding path program 1 times [2022-07-11 23:56:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:56:05,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458638642] [2022-07-11 23:56:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:05,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:56:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:56:05,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:56:05,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-11 23:56:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:07,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:56:07,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:56:07,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:56:07,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:56:07,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:56:07,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:56:07,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:56:07,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:56:07,587 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-11 23:56:07,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-11 23:56:08,027 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:56:08,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2022-07-11 23:56:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:56:08,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:56:08,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:56:08,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458638642] [2022-07-11 23:56:08,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458638642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:08,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:08,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495669377] [2022-07-11 23:56:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:08,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:08,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:56:08,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:08,045 INFO L87 Difference]: Start difference. First operand 1202 states and 1835 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:10,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:13,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:15,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:18,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:22,506 INFO L93 Difference]: Finished difference Result 2902 states and 4439 transitions. [2022-07-11 23:56:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:22,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 174 [2022-07-11 23:56:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:22,516 INFO L225 Difference]: With dead ends: 2902 [2022-07-11 23:56:22,517 INFO L226 Difference]: Without dead ends: 1710 [2022-07-11 23:56:22,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:22,518 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 56 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:22,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 617 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 1 Unknown, 0 Unchecked, 14.4s Time] [2022-07-11 23:56:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2022-07-11 23:56:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1426. [2022-07-11 23:56:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.568421052631579) internal successors, (2235), 1425 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2235 transitions. [2022-07-11 23:56:22,548 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2235 transitions. Word has length 174 [2022-07-11 23:56:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:22,548 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 2235 transitions. [2022-07-11 23:56:22,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2235 transitions. [2022-07-11 23:56:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-11 23:56:22,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:22,551 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:56:22,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-11 23:56:22,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:56:22,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:22,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash -975340285, now seen corresponding path program 1 times [2022-07-11 23:56:22,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:56:22,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604203434] [2022-07-11 23:56:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:22,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:56:22,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:56:22,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:56:22,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-11 23:56:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:56:24,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:56:24,625 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-11 23:56:24,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:56:24,660 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:56:24,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:56:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-11 23:56:24,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:56:24,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:56:24,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604203434] [2022-07-11 23:56:24,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604203434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:24,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:24,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746681399] [2022-07-11 23:56:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:24,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:56:24,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:24,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:24,682 INFO L87 Difference]: Start difference. First operand 1426 states and 2235 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:26,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:30,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:31,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:32,883 INFO L93 Difference]: Finished difference Result 2930 states and 4569 transitions. [2022-07-11 23:56:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:32,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 187 [2022-07-11 23:56:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:32,889 INFO L225 Difference]: With dead ends: 2930 [2022-07-11 23:56:32,889 INFO L226 Difference]: Without dead ends: 1514 [2022-07-11 23:56:32,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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-11 23:56:32,892 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 22 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:32,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 565 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 1 Unknown, 22 Unchecked, 8.2s Time] [2022-07-11 23:56:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-07-11 23:56:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1426. [2022-07-11 23:56:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.5628070175438598) internal successors, (2227), 1425 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2227 transitions. [2022-07-11 23:56:32,936 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2227 transitions. Word has length 187 [2022-07-11 23:56:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:32,936 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 2227 transitions. [2022-07-11 23:56:32,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2227 transitions. [2022-07-11 23:56:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-11 23:56:32,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:32,939 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:56:32,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:56:33,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:56:33,155 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 988941552, now seen corresponding path program 1 times [2022-07-11 23:56:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:56:33,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099299810] [2022-07-11 23:56:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:33,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:56:33,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:56:33,158 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:56:33,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-11 23:56:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:34,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:56:34,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:56:35,377 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-11 23:56:35,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:56:35,409 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:56:35,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:56:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-11 23:56:35,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:56:35,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:56:35,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099299810] [2022-07-11 23:56:35,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099299810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:35,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:35,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39943040] [2022-07-11 23:56:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:35,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:56:35,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:35,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:35,426 INFO L87 Difference]: Start difference. First operand 1426 states and 2227 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:37,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:39,228 INFO L93 Difference]: Finished difference Result 2930 states and 4577 transitions. [2022-07-11 23:56:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 188 [2022-07-11 23:56:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:39,234 INFO L225 Difference]: With dead ends: 2930 [2022-07-11 23:56:39,234 INFO L226 Difference]: Without dead ends: 1514 [2022-07-11 23:56:39,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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-11 23:56:39,236 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 19 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:39,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 498 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 1 Unknown, 15 Unchecked, 3.8s Time] [2022-07-11 23:56:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-07-11 23:56:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-07-11 23:56:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 1.5459352280237937) internal successors, (2339), 1513 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2339 transitions. [2022-07-11 23:56:39,270 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2339 transitions. Word has length 188 [2022-07-11 23:56:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:39,270 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2339 transitions. [2022-07-11 23:56:39,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2339 transitions. [2022-07-11 23:56:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-11 23:56:39,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:39,273 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:56:39,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:56:39,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:56:39,479 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash -617202468, now seen corresponding path program 1 times [2022-07-11 23:56:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:56:39,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737294460] [2022-07-11 23:56:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:39,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:56:39,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:56:39,482 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:56:39,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-11 23:56:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:41,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:56:41,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:56:41,535 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-11 23:56:41,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:56:41,581 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:56:41,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:56:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-11 23:56:41,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:56:41,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:56:41,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737294460] [2022-07-11 23:56:41,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737294460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:41,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:41,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608280397] [2022-07-11 23:56:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:41,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:56:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:41,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:41,599 INFO L87 Difference]: Start difference. First operand 1514 states and 2339 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:43,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:45,138 INFO L93 Difference]: Finished difference Result 3026 states and 4681 transitions. [2022-07-11 23:56:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:45,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 188 [2022-07-11 23:56:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:45,144 INFO L225 Difference]: With dead ends: 3026 [2022-07-11 23:56:45,144 INFO L226 Difference]: Without dead ends: 1522 [2022-07-11 23:56:45,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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-11 23:56:45,146 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 19 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:45,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 492 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 1 Unknown, 16 Unchecked, 3.5s Time] [2022-07-11 23:56:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-07-11 23:56:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1522. [2022-07-11 23:56:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.532544378698225) internal successors, (2331), 1521 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2331 transitions. [2022-07-11 23:56:45,180 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2331 transitions. Word has length 188 [2022-07-11 23:56:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:45,180 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 2331 transitions. [2022-07-11 23:56:45,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2331 transitions. [2022-07-11 23:56:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-11 23:56:45,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:45,183 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:56:45,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-11 23:56:45,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:56:45,399 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1565412453, now seen corresponding path program 1 times [2022-07-11 23:56:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:56:45,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441378152] [2022-07-11 23:56:45,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:45,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:56:45,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:56:45,402 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:56:45,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-11 23:56:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:47,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:56:47,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:56:47,500 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-11 23:56:47,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:56:47,546 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:56:47,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:56:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-11 23:56:47,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:56:47,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:56:47,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441378152] [2022-07-11 23:56:47,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441378152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:47,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:47,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48305855] [2022-07-11 23:56:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:47,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:47,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:56:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:47,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:47,566 INFO L87 Difference]: Start difference. First operand 1522 states and 2331 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:49,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:51,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:57,602 INFO L93 Difference]: Finished difference Result 3130 states and 4769 transitions. [2022-07-11 23:56:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:57,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 188 [2022-07-11 23:56:57,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:57,608 INFO L225 Difference]: With dead ends: 3130 [2022-07-11 23:56:57,608 INFO L226 Difference]: Without dead ends: 1618 [2022-07-11 23:56:57,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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-11 23:56:57,614 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 21 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:57,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 563 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 1 Unknown, 26 Unchecked, 10.0s Time] [2022-07-11 23:56:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2022-07-11 23:56:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1522. [2022-07-11 23:56:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.527284681130835) internal successors, (2323), 1521 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2323 transitions. [2022-07-11 23:56:57,641 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2323 transitions. Word has length 188 [2022-07-11 23:56:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:57,642 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 2323 transitions. [2022-07-11 23:56:57,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2323 transitions. [2022-07-11 23:56:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-11 23:56:57,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:57,646 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:56:57,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-11 23:56:57,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:56:57,851 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1437107291, now seen corresponding path program 1 times [2022-07-11 23:56:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:56:57,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430829416] [2022-07-11 23:56:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:57,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:56:57,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:56:57,854 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:56:57,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-11 23:56:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:59,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:56:59,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:00,034 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-11 23:57:00,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:57:00,073 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:57:00,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:57:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-11 23:57:00,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:00,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:57:00,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430829416] [2022-07-11 23:57:00,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430829416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:00,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:00,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:57:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306500540] [2022-07-11 23:57:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:00,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:57:00,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:00,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:00,090 INFO L87 Difference]: Start difference. First operand 1522 states and 2323 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:02,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:05,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:07,535 INFO L93 Difference]: Finished difference Result 3114 states and 4737 transitions. [2022-07-11 23:57:07,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:07,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 188 [2022-07-11 23:57:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:07,541 INFO L225 Difference]: With dead ends: 3114 [2022-07-11 23:57:07,541 INFO L226 Difference]: Without dead ends: 1602 [2022-07-11 23:57:07,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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-11 23:57:07,544 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 20 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:07,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 561 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 1 Unknown, 24 Unchecked, 7.4s Time] [2022-07-11 23:57:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-07-11 23:57:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1522. [2022-07-11 23:57:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.5220249835634452) internal successors, (2315), 1521 states have internal predecessors, (2315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2315 transitions. [2022-07-11 23:57:07,592 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2315 transitions. Word has length 188 [2022-07-11 23:57:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:07,593 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 2315 transitions. [2022-07-11 23:57:07,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2315 transitions. [2022-07-11 23:57:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-11 23:57:07,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:07,596 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:57:07,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-11 23:57:07,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:57:07,811 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:07,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1627778118, now seen corresponding path program 1 times [2022-07-11 23:57:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:57:07,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151176055] [2022-07-11 23:57:07,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:57:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:57:07,814 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:57:07,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-11 23:57:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:09,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:57:09,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:10,048 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-11 23:57:10,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:57:10,085 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:57:10,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:57:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-11 23:57:10,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:10,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:57:10,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151176055] [2022-07-11 23:57:10,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151176055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:10,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:10,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:57:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026199983] [2022-07-11 23:57:10,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:10,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:10,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:57:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:10,108 INFO L87 Difference]: Start difference. First operand 1522 states and 2315 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:12,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:14,066 INFO L93 Difference]: Finished difference Result 3042 states and 4633 transitions. [2022-07-11 23:57:14,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:14,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 189 [2022-07-11 23:57:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:14,072 INFO L225 Difference]: With dead ends: 3042 [2022-07-11 23:57:14,072 INFO L226 Difference]: Without dead ends: 1530 [2022-07-11 23:57:14,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 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-11 23:57:14,074 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 19 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:14,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 490 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 89 Invalid, 1 Unknown, 17 Unchecked, 3.9s Time] [2022-07-11 23:57:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-07-11 23:57:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2022-07-11 23:57:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1529 states have (on average 1.5088293001962068) internal successors, (2307), 1529 states have internal predecessors, (2307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2307 transitions. [2022-07-11 23:57:14,121 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2307 transitions. Word has length 189 [2022-07-11 23:57:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:14,122 INFO L495 AbstractCegarLoop]: Abstraction has 1530 states and 2307 transitions. [2022-07-11 23:57:14,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2307 transitions. [2022-07-11 23:57:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-11 23:57:14,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:14,125 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:57:14,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-11 23:57:14,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:57:14,351 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1146228617, now seen corresponding path program 1 times [2022-07-11 23:57:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:57:14,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497071918] [2022-07-11 23:57:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:57:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:57:14,354 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:57:14,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-11 23:57:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:16,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:57:16,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:16,694 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-11 23:57:16,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:57:16,743 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:57:16,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:57:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-11 23:57:16,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:16,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:57:16,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497071918] [2022-07-11 23:57:16,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497071918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:16,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:16,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:57:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539675282] [2022-07-11 23:57:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:16,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:57:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:16,760 INFO L87 Difference]: Start difference. First operand 1530 states and 2307 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)