./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 06:04:42,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 06:04:42,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 06:04:42,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 06:04:42,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 06:04:42,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 06:04:42,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 06:04:42,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 06:04:42,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 06:04:42,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 06:04:42,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 06:04:42,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 06:04:42,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 06:04:42,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 06:04:42,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 06:04:42,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 06:04:42,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 06:04:42,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 06:04:42,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 06:04:42,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 06:04:42,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 06:04:42,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 06:04:42,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 06:04:42,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 06:04:42,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 06:04:42,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 06:04:42,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 06:04:42,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 06:04:42,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 06:04:42,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 06:04:42,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 06:04:42,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 06:04:42,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 06:04:42,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 06:04:42,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 06:04:42,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 06:04:42,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 06:04:42,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 06:04:42,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 06:04:42,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 06:04:42,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 06:04:42,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 06:04:42,279 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 06:04:42,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 06:04:42,280 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 06:04:42,280 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 06:04:42,281 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 06:04:42,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 06:04:42,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 06:04:42,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 06:04:42,282 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 06:04:42,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 06:04:42,283 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 06:04:42,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 06:04:42,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 06:04:42,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 06:04:42,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 06:04:42,285 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 06:04:42,285 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 06:04:42,285 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 06:04:42,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 06:04:42,285 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 06:04:42,285 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 06:04:42,286 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 06:04:42,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 06:04:42,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 06:04:42,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 06:04:42,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:04:42,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 06:04:42,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 06:04:42,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 06:04:42,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 06:04:42,287 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2021-12-28 06:04:42,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 06:04:42,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 06:04:42,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 06:04:42,580 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 06:04:42,581 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 06:04:42,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2021-12-28 06:04:42,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da04f7548/f617f5e625644d9ca6848f6a59839078/FLAG1b0728009 [2021-12-28 06:04:43,058 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 06:04:43,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2021-12-28 06:04:43,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da04f7548/f617f5e625644d9ca6848f6a59839078/FLAG1b0728009 [2021-12-28 06:04:43,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da04f7548/f617f5e625644d9ca6848f6a59839078 [2021-12-28 06:04:43,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 06:04:43,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 06:04:43,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 06:04:43,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 06:04:43,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 06:04:43,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1042d07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43, skipping insertion in model container [2021-12-28 06:04:43,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 06:04:43,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 06:04:43,695 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/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2021-12-28 06:04:43,698 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:04:43,715 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 06:04:43,741 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/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2021-12-28 06:04:43,742 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:04:43,762 INFO L208 MainTranslator]: Completed translation [2021-12-28 06:04:43,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43 WrapperNode [2021-12-28 06:04:43,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 06:04:43,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 06:04:43,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 06:04:43,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 06:04:43,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,802 INFO L137 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2021-12-28 06:04:43,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 06:04:43,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 06:04:43,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 06:04:43,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 06:04:43,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 06:04:43,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 06:04:43,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 06:04:43,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 06:04:43,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (1/1) ... [2021-12-28 06:04:43,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:04:43,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:43,858 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) [2021-12-28 06:04:43,876 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 [2021-12-28 06:04:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-28 06:04:43,894 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-28 06:04:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 06:04:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 06:04:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 06:04:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 06:04:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 06:04:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 06:04:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 06:04:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 06:04:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 06:04:43,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 06:04:43,984 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 06:04:43,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 06:04:44,028 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-28 06:04:44,251 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 06:04:44,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 06:04:44,261 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-28 06:04:44,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:04:44 BoogieIcfgContainer [2021-12-28 06:04:44,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 06:04:44,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 06:04:44,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 06:04:44,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 06:04:44,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 06:04:43" (1/3) ... [2021-12-28 06:04:44,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f94c018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:04:44, skipping insertion in model container [2021-12-28 06:04:44,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:43" (2/3) ... [2021-12-28 06:04:44,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f94c018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:04:44, skipping insertion in model container [2021-12-28 06:04:44,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:04:44" (3/3) ... [2021-12-28 06:04:44,268 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2021-12-28 06:04:44,272 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 06:04:44,272 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-28 06:04:44,322 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 06:04:44,329 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 06:04:44,330 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-28 06:04:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-28 06:04:44,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:44,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-28 06:04:44,357 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:44,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-28 06:04:44,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:44,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815173975] [2021-12-28 06:04:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:44,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:44,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:44,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815173975] [2021-12-28 06:04:44,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815173975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:44,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:44,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:04:44,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091056034] [2021-12-28 06:04:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:44,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:04:44,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:04:44,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:44,526 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:44,637 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2021-12-28 06:04:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:04:44,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-28 06:04:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:44,644 INFO L225 Difference]: With dead ends: 92 [2021-12-28 06:04:44,645 INFO L226 Difference]: Without dead ends: 86 [2021-12-28 06:04:44,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:44,649 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:44,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-28 06:04:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2021-12-28 06:04:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 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) [2021-12-28 06:04:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-12-28 06:04:44,686 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 4 [2021-12-28 06:04:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:44,686 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-12-28 06:04:44,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-12-28 06:04:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-28 06:04:44,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:44,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-28 06:04:44,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 06:04:44,688 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-28 06:04:44,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:44,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493872027] [2021-12-28 06:04:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:44,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:44,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:44,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493872027] [2021-12-28 06:04:44,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493872027] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:44,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:44,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:04:44,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916191769] [2021-12-28 06:04:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:44,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:04:44,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:44,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:04:44,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:44,755 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:44,803 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-12-28 06:04:44,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:04:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-28 06:04:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:44,806 INFO L225 Difference]: With dead ends: 58 [2021-12-28 06:04:44,806 INFO L226 Difference]: Without dead ends: 58 [2021-12-28 06:04:44,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:44,810 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:44,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 42 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-28 06:04:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-12-28 06:04:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-12-28 06:04:44,823 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 4 [2021-12-28 06:04:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:44,825 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-12-28 06:04:44,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-12-28 06:04:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 06:04:44,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:44,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:44,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 06:04:44,828 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2021-12-28 06:04:44,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:44,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684940924] [2021-12-28 06:04:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:44,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:44,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:44,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684940924] [2021-12-28 06:04:44,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684940924] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:44,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:44,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:04:44,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813457193] [2021-12-28 06:04:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:44,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:04:44,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:44,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:04:44,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:44,894 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:44,954 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2021-12-28 06:04:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:04:44,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-28 06:04:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:44,956 INFO L225 Difference]: With dead ends: 98 [2021-12-28 06:04:44,956 INFO L226 Difference]: Without dead ends: 98 [2021-12-28 06:04:44,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:44,959 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:44,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 118 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-28 06:04:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2021-12-28 06:04:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-12-28 06:04:44,967 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2021-12-28 06:04:44,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:44,968 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-12-28 06:04:44,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-12-28 06:04:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 06:04:44,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:44,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:44,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 06:04:44,969 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2021-12-28 06:04:44,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:44,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614502932] [2021-12-28 06:04:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:44,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:45,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:45,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614502932] [2021-12-28 06:04:45,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614502932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:45,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:45,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:04:45,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794742182] [2021-12-28 06:04:45,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:45,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:04:45,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:04:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:45,025 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:45,064 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2021-12-28 06:04:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:04:45,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-28 06:04:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:45,065 INFO L225 Difference]: With dead ends: 98 [2021-12-28 06:04:45,065 INFO L226 Difference]: Without dead ends: 98 [2021-12-28 06:04:45,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:45,066 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:45,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-28 06:04:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 54. [2021-12-28 06:04:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-12-28 06:04:45,070 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2021-12-28 06:04:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:45,070 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-12-28 06:04:45,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-12-28 06:04:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 06:04:45,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:45,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:45,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 06:04:45,071 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2021-12-28 06:04:45,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:45,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731144089] [2021-12-28 06:04:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:45,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:45,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:45,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731144089] [2021-12-28 06:04:45,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731144089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:45,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:45,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:04:45,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942342343] [2021-12-28 06:04:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:45,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:04:45,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:04:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:45,111 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:45,116 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2021-12-28 06:04:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:04:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-28 06:04:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:45,117 INFO L225 Difference]: With dead ends: 59 [2021-12-28 06:04:45,118 INFO L226 Difference]: Without dead ends: 59 [2021-12-28 06:04:45,118 INFO L932 BasicCegarLoop]: 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 [2021-12-28 06:04:45,118 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:45,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-28 06:04:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2021-12-28 06:04:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-12-28 06:04:45,122 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2021-12-28 06:04:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:45,123 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-12-28 06:04:45,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-12-28 06:04:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 06:04:45,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:45,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:45,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 06:04:45,124 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2021-12-28 06:04:45,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:45,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724647628] [2021-12-28 06:04:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:45,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:45,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724647628] [2021-12-28 06:04:45,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724647628] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868308251] [2021-12-28 06:04:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:45,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:45,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:45,201 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) [2021-12-28 06:04:45,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 06:04:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:45,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:04:45,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:45,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:45,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868308251] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:45,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:45,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-28 06:04:45,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828471958] [2021-12-28 06:04:45,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:45,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:04:45,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:04:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:04:45,397 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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) [2021-12-28 06:04:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:45,415 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-12-28 06:04:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:04:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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 16 [2021-12-28 06:04:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:45,416 INFO L225 Difference]: With dead ends: 70 [2021-12-28 06:04:45,416 INFO L226 Difference]: Without dead ends: 70 [2021-12-28 06:04:45,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:04:45,419 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:45,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 206 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-28 06:04:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-28 06:04:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 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) [2021-12-28 06:04:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-12-28 06:04:45,426 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 16 [2021-12-28 06:04:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:45,427 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-12-28 06:04:45,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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) [2021-12-28 06:04:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-12-28 06:04:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 06:04:45,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:45,428 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:45,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 06:04:45,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 06:04:45,642 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2021-12-28 06:04:45,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:45,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688341180] [2021-12-28 06:04:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:45,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 06:04:45,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:45,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688341180] [2021-12-28 06:04:45,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688341180] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:45,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:45,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 06:04:45,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703377340] [2021-12-28 06:04:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:45,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:04:45,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:04:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:04:45,727 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:45,841 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2021-12-28 06:04:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:04:45,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 31 [2021-12-28 06:04:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:45,842 INFO L225 Difference]: With dead ends: 92 [2021-12-28 06:04:45,842 INFO L226 Difference]: Without dead ends: 92 [2021-12-28 06:04:45,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:04:45,843 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 158 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:45,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 88 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-28 06:04:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2021-12-28 06:04:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 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) [2021-12-28 06:04:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2021-12-28 06:04:45,846 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 31 [2021-12-28 06:04:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:45,847 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2021-12-28 06:04:45,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2021-12-28 06:04:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 06:04:45,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:45,848 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:45,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 06:04:45,848 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2021-12-28 06:04:45,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:45,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869282522] [2021-12-28 06:04:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:45,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-28 06:04:45,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:45,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869282522] [2021-12-28 06:04:45,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869282522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:45,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:45,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 06:04:45,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12172613] [2021-12-28 06:04:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:45,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:04:45,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:45,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:04:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:04:45,932 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:46,045 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-12-28 06:04:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:04:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 31 [2021-12-28 06:04:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:46,046 INFO L225 Difference]: With dead ends: 73 [2021-12-28 06:04:46,046 INFO L226 Difference]: Without dead ends: 73 [2021-12-28 06:04:46,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:04:46,047 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:46,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 60 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-28 06:04:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2021-12-28 06:04:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 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) [2021-12-28 06:04:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-12-28 06:04:46,050 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 31 [2021-12-28 06:04:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:46,050 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-12-28 06:04:46,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-12-28 06:04:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 06:04:46,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:46,051 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:46,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 06:04:46,052 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash 142544443, now seen corresponding path program 1 times [2021-12-28 06:04:46,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:46,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841025450] [2021-12-28 06:04:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:46,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-28 06:04:46,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:46,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841025450] [2021-12-28 06:04:46,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841025450] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:46,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433079901] [2021-12-28 06:04:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:46,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:46,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:46,294 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) [2021-12-28 06:04:46,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 06:04:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:46,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-28 06:04:46,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:46,626 INFO L387 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 [2021-12-28 06:04:46,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:46,704 INFO L387 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 21 treesize of output 20 [2021-12-28 06:04:46,786 INFO L387 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 [2021-12-28 06:04:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-28 06:04:46,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:47,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2021-12-28 06:04:48,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-28 06:04:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 7 not checked. [2021-12-28 06:04:49,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433079901] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:49,011 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:49,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-28 06:04:49,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309446054] [2021-12-28 06:04:49,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:49,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-28 06:04:49,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:49,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-28 06:04:49,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=446, Unknown=2, NotChecked=86, Total=600 [2021-12-28 06:04:49,013 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:49,453 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_main_~data_init~0#1|) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-28 06:04:49,800 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) is different from false [2021-12-28 06:04:50,148 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) is different from false [2021-12-28 06:04:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:50,320 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-12-28 06:04:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 06:04:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-28 06:04:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:50,321 INFO L225 Difference]: With dead ends: 70 [2021-12-28 06:04:50,322 INFO L226 Difference]: Without dead ends: 70 [2021-12-28 06:04:50,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=129, Invalid=698, Unknown=5, NotChecked=290, Total=1122 [2021-12-28 06:04:50,323 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:50,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 546 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2021-12-28 06:04:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-28 06:04:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-28 06:04:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 69 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) [2021-12-28 06:04:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-12-28 06:04:50,326 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 33 [2021-12-28 06:04:50,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:50,326 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-12-28 06:04:50,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-12-28 06:04:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 06:04:50,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:50,328 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:50,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 06:04:50,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-28 06:04:50,540 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:04:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2021-12-28 06:04:50,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:50,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677110603] [2021-12-28 06:04:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:50,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:04:50,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:50,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677110603] [2021-12-28 06:04:50,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677110603] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:50,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768047010] [2021-12-28 06:04:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:50,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:50,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:50,858 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) [2021-12-28 06:04:50,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 06:04:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:50,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-28 06:04:50,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:51,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-28 06:04:51,057 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 06:04:51,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2021-12-28 06:04:51,104 INFO L387 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 11 treesize of output 7 [2021-12-28 06:04:51,109 INFO L387 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 11 treesize of output 7 [2021-12-28 06:04:51,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:51,141 INFO L387 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 21 treesize of output 20 [2021-12-28 06:04:51,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:51,148 INFO L387 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 31 treesize of output 26 [2021-12-28 06:04:51,208 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-28 06:04:51,209 INFO L387 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 19 treesize of output 18 [2021-12-28 06:04:51,221 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-28 06:04:51,221 INFO L387 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 29 treesize of output 28 [2021-12-28 06:04:51,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:51,490 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 06:04:51,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 54 [2021-12-28 06:04:51,530 INFO L353 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-12-28 06:04:51,530 INFO L387 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 53 [2021-12-28 06:04:51,597 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-12-28 06:04:51,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 41 [2021-12-28 06:04:51,607 INFO L353 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-12-28 06:04:51,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 19 [2021-12-28 06:04:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:04:51,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:53,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-28 06:04:55,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from false [2021-12-28 06:04:57,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_606)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_604 Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_604)))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0))))) is different from false [2021-12-28 06:04:57,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-12-28 06:04:58,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768047010] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:58,089 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:58,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2021-12-28 06:04:58,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244854713] [2021-12-28 06:04:58,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:58,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-28 06:04:58,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:58,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-28 06:04:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=624, Unknown=3, NotChecked=156, Total=870 [2021-12-28 06:04:58,091 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 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) [2021-12-28 06:05:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:05:55,756 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-12-28 06:05:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 06:05:55,757 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 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 37 [2021-12-28 06:05:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:05:55,757 INFO L225 Difference]: With dead ends: 100 [2021-12-28 06:05:55,757 INFO L226 Difference]: Without dead ends: 100 [2021-12-28 06:05:55,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 63.7s TimeCoverageRelationStatistics Valid=179, Invalid=947, Unknown=8, NotChecked=198, Total=1332 [2021-12-28 06:05:55,759 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 88 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 06:05:55,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 224 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 624 Invalid, 0 Unknown, 273 Unchecked, 0.3s Time] [2021-12-28 06:05:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-28 06:05:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2021-12-28 06:05:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.378787878787879) internal successors, (91), 79 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) [2021-12-28 06:05:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2021-12-28 06:05:55,766 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 37 [2021-12-28 06:05:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:05:55,766 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2021-12-28 06:05:55,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 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) [2021-12-28 06:05:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2021-12-28 06:05:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 06:05:55,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:05:55,767 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:05:55,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 06:05:55,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:05:55,967 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:05:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:05:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2021-12-28 06:05:55,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:05:55,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949240609] [2021-12-28 06:05:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:55,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:05:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:05:56,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:05:56,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949240609] [2021-12-28 06:05:56,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949240609] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:05:56,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855567148] [2021-12-28 06:05:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:56,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:05:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:05:56,306 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) [2021-12-28 06:05:56,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 06:05:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:56,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-28 06:05:56,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:05:56,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-28 06:05:56,556 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 06:05:56,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2021-12-28 06:05:56,606 INFO L387 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 11 treesize of output 7 [2021-12-28 06:05:56,612 INFO L387 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 11 treesize of output 7 [2021-12-28 06:05:56,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:05:56,649 INFO L387 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 21 treesize of output 20 [2021-12-28 06:05:56,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:05:56,657 INFO L387 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 31 treesize of output 26 [2021-12-28 06:05:56,722 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-28 06:05:56,723 INFO L387 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 29 treesize of output 28 [2021-12-28 06:05:56,731 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-28 06:05:56,731 INFO L387 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 19 treesize of output 18 [2021-12-28 06:05:57,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:05:57,003 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 06:05:57,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2021-12-28 06:05:57,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:05:57,007 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 06:05:57,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2021-12-28 06:05:57,036 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:05:57,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2021-12-28 06:05:57,047 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-28 06:05:57,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 45 [2021-12-28 06:05:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:05:57,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:05:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:05:57,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855567148] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:05:57,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:05:57,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2021-12-28 06:05:58,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354011043] [2021-12-28 06:05:58,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:05:58,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-28 06:05:58,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:05:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-28 06:05:58,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2021-12-28 06:05:58,001 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:05:59,079 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2021-12-28 06:05:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-28 06:05:59,080 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-28 06:05:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:05:59,082 INFO L225 Difference]: With dead ends: 110 [2021-12-28 06:05:59,082 INFO L226 Difference]: Without dead ends: 110 [2021-12-28 06:05:59,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=296, Invalid=2356, Unknown=0, NotChecked=0, Total=2652 [2021-12-28 06:05:59,086 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 163 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 06:05:59,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 201 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 609 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2021-12-28 06:05:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-28 06:05:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2021-12-28 06:05:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.375) internal successors, (99), 84 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) [2021-12-28 06:05:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2021-12-28 06:05:59,091 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 37 [2021-12-28 06:05:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:05:59,091 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2021-12-28 06:05:59,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2021-12-28 06:05:59,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-28 06:05:59,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:05:59,096 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:05:59,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 06:05:59,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:05:59,307 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:05:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:05:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327535, now seen corresponding path program 1 times [2021-12-28 06:05:59,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:05:59,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698806632] [2021-12-28 06:05:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:59,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:05:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-28 06:05:59,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:05:59,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698806632] [2021-12-28 06:05:59,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698806632] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:05:59,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:05:59,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:05:59,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820710656] [2021-12-28 06:05:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:05:59,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:05:59,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:05:59,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:05:59,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:05:59,364 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:05:59,468 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2021-12-28 06:05:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:05:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 [2021-12-28 06:05:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:05:59,469 INFO L225 Difference]: With dead ends: 115 [2021-12-28 06:05:59,469 INFO L226 Difference]: Without dead ends: 115 [2021-12-28 06:05:59,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:05:59,470 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:05:59,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 100 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:05:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-28 06:05:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2021-12-28 06:05:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 89 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) [2021-12-28 06:05:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2021-12-28 06:05:59,472 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 38 [2021-12-28 06:05:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:05:59,473 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2021-12-28 06:05:59,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2021-12-28 06:05:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-28 06:05:59,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:05:59,483 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:05:59,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 06:05:59,483 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:05:59,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:05:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327534, now seen corresponding path program 1 times [2021-12-28 06:05:59,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:05:59,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886602893] [2021-12-28 06:05:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:59,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:05:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-28 06:05:59,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:05:59,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886602893] [2021-12-28 06:05:59,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886602893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:05:59,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:05:59,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:05:59,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059975802] [2021-12-28 06:05:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:05:59,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:05:59,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:05:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:05:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:05:59,584 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:05:59,709 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-28 06:05:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:05:59,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 [2021-12-28 06:05:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:05:59,710 INFO L225 Difference]: With dead ends: 95 [2021-12-28 06:05:59,710 INFO L226 Difference]: Without dead ends: 95 [2021-12-28 06:05:59,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-28 06:05:59,711 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 292 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:05:59,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 37 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:05:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-28 06:05:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-28 06:05:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 84 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2021-12-28 06:05:59,713 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 38 [2021-12-28 06:05:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:05:59,713 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2021-12-28 06:05:59,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2021-12-28 06:05:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 06:05:59,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:05:59,714 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:05:59,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 06:05:59,714 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-28 06:05:59,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:05:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash -494379317, now seen corresponding path program 1 times [2021-12-28 06:05:59,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:05:59,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839747525] [2021-12-28 06:05:59,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:59,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:05:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:06:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:06:00,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:06:00,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839747525] [2021-12-28 06:06:00,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839747525] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:06:00,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617703065] [2021-12-28 06:06:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:06:00,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:06:00,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:06:00,245 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) [2021-12-28 06:06:00,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 06:06:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:06:00,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-28 06:06:00,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:06:00,515 INFO L387 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 [2021-12-28 06:06:00,634 INFO L387 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 11 treesize of output 7 [2021-12-28 06:06:00,646 INFO L387 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 11 treesize of output 7 [2021-12-28 06:06:00,659 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-28 06:06:00,659 INFO L387 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 18 treesize of output 28 [2021-12-28 06:06:00,666 INFO L387 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 5 treesize of output 3 [2021-12-28 06:06:00,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:06:00,714 INFO L387 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 21 treesize of output 20 [2021-12-28 06:06:00,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:06:00,720 INFO L387 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 33 treesize of output 28 [2021-12-28 06:06:00,730 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-28 06:06:00,734 INFO L387 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 26 treesize of output 36 [2021-12-28 06:06:00,833 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-28 06:06:00,834 INFO L387 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 31 treesize of output 30 [2021-12-28 06:06:00,837 INFO L387 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 23 treesize of output 22 [2021-12-28 06:06:00,846 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-28 06:06:00,846 INFO L387 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 19 treesize of output 18 [2021-12-28 06:06:01,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:06:01,178 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 06:06:01,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 56 [2021-12-28 06:06:01,196 INFO L353 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-12-28 06:06:01,197 INFO L387 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 71 [2021-12-28 06:06:01,207 INFO L353 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2021-12-28 06:06:01,208 INFO L387 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 38 treesize of output 52 [2021-12-28 06:06:01,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-28 06:06:01,307 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-12-28 06:06:01,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 43 [2021-12-28 06:06:01,320 INFO L353 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-12-28 06:06:01,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 19 [2021-12-28 06:06:01,435 INFO L387 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 15 treesize of output 7 [2021-12-28 06:06:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:06:01,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:06:01,901 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1143 Int) (v_ArrVal_1147 Int) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1143) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1147) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1141)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1144) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-28 06:06:01,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1143 Int) (v_ArrVal_1147 Int) (v_ArrVal_1144 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1143) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1147) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1141)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2021-12-28 06:06:02,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 Int) (v_ArrVal_1143 Int) (v_ArrVal_1136 Int) (v_ArrVal_1147 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1135 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse1 (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1135)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1143) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1136)))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1147) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1133))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1141))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1144) .cse1) (+ .cse2 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) is different from false [2021-12-28 06:06:02,082 INFO L353 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2021-12-28 06:06:02,082 INFO L387 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 3 case distinctions, treesize of input 206 treesize of output 176 [2021-12-28 06:06:02,092 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:06:02,092 INFO L387 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 204 [2021-12-28 06:06:02,100 INFO L173 IndexEqualityManager]: detected equality via solver