./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b 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/dll_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 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:51:43,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:51:43,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:51:43,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:51:43,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:51:43,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:51:43,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:51:43,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:51:43,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:51:43,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:51:43,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:51:43,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:51:43,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:51:43,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:51:43,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:51:43,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:51:43,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:51:43,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:51:43,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:51:43,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:51:43,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:51:43,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:51:43,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:51:43,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:51:43,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:51:43,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:51:43,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:51:43,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:51:43,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:51:43,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:51:43,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:51:43,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:51:43,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:51:43,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:51:43,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:51:43,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:51:43,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:51:43,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:51:43,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:51:43,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:51:43,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:51:43,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:51:44,006 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:51:44,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:51:44,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:51:44,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:51:44,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:51:44,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:51:44,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:51:44,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:51:44,008 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:51:44,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:51:44,009 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:51:44,009 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:51:44,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:51:44,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:51:44,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:51:44,010 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:51:44,010 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:51:44,010 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:51:44,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:51:44,010 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:51:44,011 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:51:44,011 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:51:44,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:51:44,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:51:44,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:51:44,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:51:44,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:51:44,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:51:44,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:51:44,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:51:44,013 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:51:44,013 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 -> 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa [2021-12-14 19:51:44,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:51:44,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:51:44,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:51:44,216 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:51:44,217 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:51:44,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2021-12-14 19:51:44,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abafe050/789cee63f0254c6a8bf7f96d93e4d3ab/FLAGd6dc36203 [2021-12-14 19:51:44,705 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:51:44,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2021-12-14 19:51:44,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abafe050/789cee63f0254c6a8bf7f96d93e4d3ab/FLAGd6dc36203 [2021-12-14 19:51:44,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7abafe050/789cee63f0254c6a8bf7f96d93e4d3ab [2021-12-14 19:51:44,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:51:44,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:51:44,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:51:44,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:51:44,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:51:44,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:51:44" (1/1) ... [2021-12-14 19:51:44,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c86b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:44, skipping insertion in model container [2021-12-14 19:51:44,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:51:44" (1/1) ... [2021-12-14 19:51:44,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:51:44,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:51:44,978 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/dll_circular_traversal-1.i[24175,24188] [2021-12-14 19:51:44,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:51:44,989 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:51:45,027 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/dll_circular_traversal-1.i[24175,24188] [2021-12-14 19:51:45,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:51:45,044 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:51:45,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45 WrapperNode [2021-12-14 19:51:45,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:51:45,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:51:45,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:51:45,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:51:45,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,086 INFO L137 Inliner]: procedures = 122, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2021-12-14 19:51:45,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:51:45,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:51:45,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:51:45,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:51:45,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:51:45,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:51:45,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:51:45,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:51:45,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (1/1) ... [2021-12-14 19:51:45,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:51:45,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:45,158 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-14 19:51:45,196 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-14 19:51:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-14 19:51:45,211 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-14 19:51:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:51:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:51:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:51:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:51:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:51:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:51:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:51:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:51:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:51:45,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:51:45,321 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:51:45,322 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:51:45,340 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-14 19:51:45,490 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:51:45,504 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:51:45,505 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 19:51:45,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:51:45 BoogieIcfgContainer [2021-12-14 19:51:45,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:51:45,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:51:45,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:51:45,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:51:45,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:51:44" (1/3) ... [2021-12-14 19:51:45,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9c0f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:51:45, skipping insertion in model container [2021-12-14 19:51:45,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:45" (2/3) ... [2021-12-14 19:51:45,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9c0f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:51:45, skipping insertion in model container [2021-12-14 19:51:45,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:51:45" (3/3) ... [2021-12-14 19:51:45,513 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2021-12-14 19:51:45,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:51:45,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2021-12-14 19:51:45,554 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:51:45,559 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-14 19:51:45,560 INFO L340 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2021-12-14 19:51:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 40 states have (on average 2.05) internal successors, (82), 73 states have internal predecessors, (82), 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-14 19:51:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:51:45,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:45,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:51:45,575 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:45,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-14 19:51:45,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:45,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650580761] [2021-12-14 19:51:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:45,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:45,678 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-14 19:51:45,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:45,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650580761] [2021-12-14 19:51:45,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650580761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:45,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:45,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:51:45,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268320187] [2021-12-14 19:51:45,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:45,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:45,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:45,725 INFO L87 Difference]: Start difference. First operand has 75 states, 40 states have (on average 2.05) internal successors, (82), 73 states have internal predecessors, (82), 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-14 19:51:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:45,839 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2021-12-14 19:51:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:45,841 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-14 19:51:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:45,845 INFO L225 Difference]: With dead ends: 91 [2021-12-14 19:51:45,845 INFO L226 Difference]: Without dead ends: 83 [2021-12-14 19:51:45,847 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-14 19:51:45,848 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:45,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-14 19:51:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2021-12-14 19:51:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-12-14 19:51:45,890 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 4 [2021-12-14 19:51:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:45,891 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-12-14 19:51:45,891 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-14 19:51:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-12-14 19:51:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:51:45,906 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:45,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:51:45,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:51:45,907 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-14 19:51:45,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:45,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125820802] [2021-12-14 19:51:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:45,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:45,966 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-14 19:51:45,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:45,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125820802] [2021-12-14 19:51:45,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125820802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:45,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:45,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:51:45,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820530645] [2021-12-14 19:51:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:45,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:45,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:45,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:45,968 INFO L87 Difference]: Start difference. First operand 65 states and 69 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-14 19:51:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:46,006 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-12-14 19:51:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:46,006 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-14 19:51:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:46,007 INFO L225 Difference]: With dead ends: 61 [2021-12-14 19:51:46,007 INFO L226 Difference]: Without dead ends: 61 [2021-12-14 19:51:46,007 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-14 19:51:46,008 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:46,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 38 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-14 19:51:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-12-14 19:51:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.7567567567567568) 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-14 19:51:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-12-14 19:51:46,014 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 4 [2021-12-14 19:51:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:46,014 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-12-14 19:51:46,014 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-14 19:51:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-12-14 19:51:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:51:46,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:46,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:46,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:51:46,015 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -401980428, now seen corresponding path program 1 times [2021-12-14 19:51:46,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:46,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808207384] [2021-12-14 19:51:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:46,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,057 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-14 19:51:46,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:46,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808207384] [2021-12-14 19:51:46,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808207384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:46,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:46,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:51:46,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336313482] [2021-12-14 19:51:46,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:46,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:46,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:46,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:46,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:46,060 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 19:51:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:46,118 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-12-14 19:51:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-12-14 19:51:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:46,119 INFO L225 Difference]: With dead ends: 100 [2021-12-14 19:51:46,120 INFO L226 Difference]: Without dead ends: 100 [2021-12-14 19:51:46,120 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-14 19:51:46,121 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 50 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:46,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 110 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-14 19:51:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 59. [2021-12-14 19:51:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-12-14 19:51:46,126 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 10 [2021-12-14 19:51:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:46,126 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-12-14 19:51:46,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 19:51:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-12-14 19:51:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:51:46,127 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:46,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:46,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:51:46,127 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -401980427, now seen corresponding path program 1 times [2021-12-14 19:51:46,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:46,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946147095] [2021-12-14 19:51:46,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:46,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,178 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-14 19:51:46,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:46,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946147095] [2021-12-14 19:51:46,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946147095] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:46,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:46,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:51:46,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790077284] [2021-12-14 19:51:46,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:46,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:46,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:46,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:46,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:46,190 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 19:51:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:46,242 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2021-12-14 19:51:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:46,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-12-14 19:51:46,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:46,244 INFO L225 Difference]: With dead ends: 100 [2021-12-14 19:51:46,244 INFO L226 Difference]: Without dead ends: 100 [2021-12-14 19:51:46,244 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-14 19:51:46,245 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 52 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:46,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 119 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-14 19:51:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 57. [2021-12-14 19:51:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-12-14 19:51:46,251 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 10 [2021-12-14 19:51:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:46,252 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-12-14 19:51:46,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 19:51:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-12-14 19:51:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:51:46,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:46,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:46,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:51:46,253 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash -401981869, now seen corresponding path program 1 times [2021-12-14 19:51:46,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:46,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288264791] [2021-12-14 19:51:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:46,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,331 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-14 19:51:46,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:46,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288264791] [2021-12-14 19:51:46,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288264791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:46,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:46,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:51:46,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527646745] [2021-12-14 19:51:46,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:46,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:51:46,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:46,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:51:46,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:46,336 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 19:51:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:46,422 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-12-14 19:51:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:51:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-12-14 19:51:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:46,426 INFO L225 Difference]: With dead ends: 84 [2021-12-14 19:51:46,426 INFO L226 Difference]: Without dead ends: 84 [2021-12-14 19:51:46,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:46,431 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 106 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:46,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-14 19:51:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2021-12-14 19:51:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 63 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-14 19:51:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-12-14 19:51:46,444 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 10 [2021-12-14 19:51:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:46,445 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-12-14 19:51:46,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 19:51:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-12-14 19:51:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:51:46,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:46,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:46,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:51:46,447 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash -401981868, now seen corresponding path program 1 times [2021-12-14 19:51:46,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:46,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378472536] [2021-12-14 19:51:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:46,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,476 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-14 19:51:46,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:46,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378472536] [2021-12-14 19:51:46,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378472536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:46,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:46,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:51:46,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264001823] [2021-12-14 19:51:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:46,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:46,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:46,479 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 19:51:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:46,484 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-12-14 19:51:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:46,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-12-14 19:51:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:46,485 INFO L225 Difference]: With dead ends: 64 [2021-12-14 19:51:46,486 INFO L226 Difference]: Without dead ends: 64 [2021-12-14 19:51:46,486 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-14 19:51:46,486 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 111 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-14 19:51:46,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 111 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-14 19:51:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2021-12-14 19:51:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-12-14 19:51:46,490 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 10 [2021-12-14 19:51:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:46,490 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-12-14 19:51:46,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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-14 19:51:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-12-14 19:51:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:51:46,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:46,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:46,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:51:46,491 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash 243865784, now seen corresponding path program 1 times [2021-12-14 19:51:46,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:46,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244146758] [2021-12-14 19:51:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:46,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,627 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-14 19:51:46,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:46,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244146758] [2021-12-14 19:51:46,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244146758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:46,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:46,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:51:46,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978479707] [2021-12-14 19:51:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:46,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:46,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:46,631 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-14 19:51:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:46,718 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2021-12-14 19:51:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:51:46,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-14 19:51:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:46,720 INFO L225 Difference]: With dead ends: 81 [2021-12-14 19:51:46,720 INFO L226 Difference]: Without dead ends: 81 [2021-12-14 19:51:46,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:51:46,722 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 140 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:46,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 58 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-14 19:51:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 62. [2021-12-14 19:51:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-12-14 19:51:46,737 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 12 [2021-12-14 19:51:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:46,738 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-12-14 19:51:46,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-14 19:51:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-12-14 19:51:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:51:46,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:46,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:46,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:51:46,739 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -27720857, now seen corresponding path program 1 times [2021-12-14 19:51:46,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:46,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714669382] [2021-12-14 19:51:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:46,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:46,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:46,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714669382] [2021-12-14 19:51:46,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714669382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:46,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:46,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:51:46,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103195127] [2021-12-14 19:51:46,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:46,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:51:46,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:46,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:51:46,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:51:46,794 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-14 19:51:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:46,849 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-12-14 19:51:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:51:46,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-14 19:51:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:46,850 INFO L225 Difference]: With dead ends: 78 [2021-12-14 19:51:46,850 INFO L226 Difference]: Without dead ends: 78 [2021-12-14 19:51:46,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:46,852 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 86 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:46,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 65 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-14 19:51:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2021-12-14 19:51:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 59 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-14 19:51:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-12-14 19:51:46,854 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2021-12-14 19:51:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:46,855 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-12-14 19:51:46,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-14 19:51:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-12-14 19:51:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:51:46,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:46,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:46,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:51:46,856 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:46,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash -27720856, now seen corresponding path program 1 times [2021-12-14 19:51:46,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:46,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631650116] [2021-12-14 19:51:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:46,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,889 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-14 19:51:46,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:46,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631650116] [2021-12-14 19:51:46,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631650116] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:46,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351340535] [2021-12-14 19:51:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:46,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:46,896 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-14 19:51:46,897 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-14 19:51:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:46,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:51:46,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:47,032 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-14 19:51:47,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:47,071 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-14 19:51:47,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351340535] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:47,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:47,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-14 19:51:47,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762230715] [2021-12-14 19:51:47,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:47,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:47,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:47,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:47,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:47,096 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-14 19:51:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:47,110 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-12-14 19:51:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:47,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-14 19:51:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:47,111 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:51:47,111 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:51:47,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:47,112 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:47,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 117 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:51:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2021-12-14 19:51:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2021-12-14 19:51:47,115 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 16 [2021-12-14 19:51:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:47,115 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2021-12-14 19:51:47,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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-14 19:51:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2021-12-14 19:51:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 19:51:47,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:47,116 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:47,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 19:51:47,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:47,334 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -868554548, now seen corresponding path program 1 times [2021-12-14 19:51:47,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:47,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953882969] [2021-12-14 19:51:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:47,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:47,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:47,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953882969] [2021-12-14 19:51:47,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953882969] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:47,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833789433] [2021-12-14 19:51:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:47,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:47,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:47,389 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-14 19:51:47,391 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-14 19:51:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:47,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:51:47,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:47,537 INFO L388 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-14 19:51:47,541 INFO L388 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-14 19:51:47,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:47,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-14 19:51:47,632 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:47,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:51:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:47,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:47,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833789433] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:47,833 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:47,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2021-12-14 19:51:47,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004452320] [2021-12-14 19:51:47,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:47,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:51:47,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:47,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:51:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:51:47,835 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:47,982 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2021-12-14 19:51:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:51:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 19:51:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:47,983 INFO L225 Difference]: With dead ends: 90 [2021-12-14 19:51:47,983 INFO L226 Difference]: Without dead ends: 90 [2021-12-14 19:51:47,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:51:47,984 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 265 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:47,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 67 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2021-12-14 19:51:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-14 19:51:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2021-12-14 19:51:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2021-12-14 19:51:47,986 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 18 [2021-12-14 19:51:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:47,987 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2021-12-14 19:51:47,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2021-12-14 19:51:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:51:47,988 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:47,988 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:48,017 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-14 19:51:48,202 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,SelfDestructingSolverStorable9 [2021-12-14 19:51:48,202 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:48,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 140768543, now seen corresponding path program 1 times [2021-12-14 19:51:48,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:48,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333161016] [2021-12-14 19:51:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:48,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:51:48,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333161016] [2021-12-14 19:51:48,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333161016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:48,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:48,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:51:48,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563603220] [2021-12-14 19:51:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:48,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:48,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:48,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:48,294 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-14 19:51:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:48,398 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2021-12-14 19:51:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:51:48,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 37 [2021-12-14 19:51:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:48,399 INFO L225 Difference]: With dead ends: 88 [2021-12-14 19:51:48,399 INFO L226 Difference]: Without dead ends: 88 [2021-12-14 19:51:48,400 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-14 19:51:48,401 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 141 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:48,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 71 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-14 19:51:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2021-12-14 19:51:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 68 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-14 19:51:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2021-12-14 19:51:48,408 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 37 [2021-12-14 19:51:48,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:48,410 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2021-12-14 19:51:48,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-14 19:51:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2021-12-14 19:51:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:51:48,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:48,411 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:48,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:51:48,412 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash 140768544, now seen corresponding path program 1 times [2021-12-14 19:51:48,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:48,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077923861] [2021-12-14 19:51:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:48,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 19:51:48,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:48,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077923861] [2021-12-14 19:51:48,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077923861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:48,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:48,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:51:48,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621471978] [2021-12-14 19:51:48,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:48,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:48,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:48,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:48,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:48,510 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 19:51:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:48,605 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-12-14 19:51:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:48,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 19:51:48,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:48,606 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:51:48,606 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:51:48,606 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-14 19:51:48,607 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 149 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:48,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 50 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:51:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2021-12-14 19:51:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2021-12-14 19:51:48,608 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 37 [2021-12-14 19:51:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:48,609 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2021-12-14 19:51:48,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 19:51:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-12-14 19:51:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:51:48,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:48,609 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:48,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:51:48,609 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:48,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1747626123, now seen corresponding path program 1 times [2021-12-14 19:51:48,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:48,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072856158] [2021-12-14 19:51:48,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:48,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 19:51:48,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072856158] [2021-12-14 19:51:48,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072856158] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955791939] [2021-12-14 19:51:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:48,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:48,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:48,869 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-14 19:51:48,870 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-14 19:51:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:48,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-14 19:51:48,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:49,111 INFO L388 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-14 19:51:49,196 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:49,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:51:49,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-14 19:51:49,296 INFO L388 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 14 treesize of output 16 [2021-12-14 19:51:49,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:49,360 INFO L388 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-14 19:51:49,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:49,402 INFO L388 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-14 19:51:49,453 INFO L388 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-14 19:51:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:49,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:50,576 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_839 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_839)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-14 19:51:51,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_839 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_839)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-14 19:51:51,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_837))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_839))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-14 19:51:51,403 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:51,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2021-12-14 19:51:51,418 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:51,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 284 [2021-12-14 19:51:51,433 INFO L388 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 318 treesize of output 302 [2021-12-14 19:51:51,567 INFO L388 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 39 treesize of output 33 [2021-12-14 19:51:51,744 INFO L388 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 10 treesize of output 8 [2021-12-14 19:51:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2021-12-14 19:51:51,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955791939] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:51,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:51,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2021-12-14 19:51:51,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330487416] [2021-12-14 19:51:51,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:51,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-14 19:51:51,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:51,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-14 19:51:51,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=675, Unknown=3, NotChecked=162, Total=930 [2021-12-14 19:51:51,830 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:52,030 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_837))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_839))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-14 19:51:52,407 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (forall ((v_ArrVal_839 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_839)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-14 19:51:52,747 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((v_ArrVal_839 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_839)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-14 19:51:52,773 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_837))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_839))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-14 19:51:53,401 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((v_ArrVal_839 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_839)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-14 19:51:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:53,563 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2021-12-14 19:51:53,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 19:51:53,563 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-14 19:51:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:53,565 INFO L225 Difference]: With dead ends: 72 [2021-12-14 19:51:53,566 INFO L226 Difference]: Without dead ends: 72 [2021-12-14 19:51:53,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=185, Invalid=1099, Unknown=8, NotChecked=600, Total=1892 [2021-12-14 19:51:53,568 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:53,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 620 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 398 Invalid, 0 Unknown, 133 Unchecked, 0.2s Time] [2021-12-14 19:51:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-14 19:51:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-14 19:51:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2021-12-14 19:51:53,570 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 40 [2021-12-14 19:51:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:53,570 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2021-12-14 19:51:53,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2021-12-14 19:51:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:51:53,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:53,574 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:53,592 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-14 19:51:53,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:53,787 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:53,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -56889687, now seen corresponding path program 1 times [2021-12-14 19:51:53,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:53,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357234086] [2021-12-14 19:51:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:53,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:51:53,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:53,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357234086] [2021-12-14 19:51:53,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357234086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:53,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:53,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:51:53,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743741493] [2021-12-14 19:51:53,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:53,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:51:53,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:53,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:51:53,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:51:53,877 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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-14 19:51:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:53,973 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2021-12-14 19:51:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:51:53,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 43 [2021-12-14 19:51:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:53,974 INFO L225 Difference]: With dead ends: 92 [2021-12-14 19:51:53,974 INFO L226 Difference]: Without dead ends: 92 [2021-12-14 19:51:53,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:51:53,975 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 194 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:53,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 75 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-14 19:51:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2021-12-14 19:51:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.25) internal successors, (75), 70 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-14 19:51:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2021-12-14 19:51:53,976 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 43 [2021-12-14 19:51:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:53,977 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-12-14 19:51:53,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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-14 19:51:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2021-12-14 19:51:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:51:53,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:53,977 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:53,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:51:53,977 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -56889686, now seen corresponding path program 1 times [2021-12-14 19:51:53,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:53,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313452954] [2021-12-14 19:51:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:53,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 19:51:54,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:54,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313452954] [2021-12-14 19:51:54,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313452954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:54,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:54,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:51:54,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710132827] [2021-12-14 19:51:54,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:54,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:51:54,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:54,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:51:54,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:51:54,104 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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-14 19:51:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:54,244 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2021-12-14 19:51:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:51:54,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 43 [2021-12-14 19:51:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:54,244 INFO L225 Difference]: With dead ends: 74 [2021-12-14 19:51:54,245 INFO L226 Difference]: Without dead ends: 74 [2021-12-14 19:51:54,246 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-14 19:51:54,248 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 163 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:54,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 57 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-14 19:51:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2021-12-14 19:51:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2333333333333334) 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-14 19:51:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-12-14 19:51:54,252 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 43 [2021-12-14 19:51:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:54,253 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-12-14 19:51:54,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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-14 19:51:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-12-14 19:51:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:51:54,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:54,255 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:54,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:51:54,255 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:51:54,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:54,256 INFO L85 PathProgramCache]: Analyzing trace with hash -56889649, now seen corresponding path program 1 times [2021-12-14 19:51:54,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:54,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250689688] [2021-12-14 19:51:54,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:54,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:51:54,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:54,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250689688] [2021-12-14 19:51:54,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250689688] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:54,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033745300] [2021-12-14 19:51:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:54,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:54,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:54,594 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-14 19:51:54,595 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-14 19:51:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:54,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-14 19:51:54,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:54,780 INFO L388 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-14 19:51:54,863 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:51:54,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:51:54,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-14 19:51:54,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-14 19:51:55,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-14 19:51:55,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-14 19:51:55,045 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:55,046 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-14 19:51:55,049 INFO L388 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 22 treesize of output 24 [2021-12-14 19:51:55,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:55,156 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-14 19:51:55,157 INFO L388 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 21 treesize of output 20 [2021-12-14 19:51:55,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:55,168 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:51:55,168 INFO L388 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 33 treesize of output 30 [2021-12-14 19:51:55,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:55,271 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:51:55,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-12-14 19:51:55,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:55,281 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:51:55,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-14 19:51:55,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,717 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:51:55,717 INFO L388 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 57 treesize of output 46 [2021-12-14 19:51:55,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,724 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:51:55,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-12-14 19:51:55,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:55,851 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-12-14 19:51:55,852 INFO L388 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 55 treesize of output 39 [2021-12-14 19:51:55,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:55,858 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:51:55,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 10 [2021-12-14 19:51:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:55,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:58,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-14 19:52:00,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (= (select |c_#valid| .cse2) 1))))) is different from false [2021-12-14 19:52:00,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1327 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1327))) (store .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))) (or (and (forall ((v_ArrVal_1325 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1325))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1)) (= (select |c_#valid| .cse1) 1)))) is different from false [2021-12-14 19:52:00,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1322 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1322)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1327))) (store .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))) (or (and (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1321 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1321)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1325))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1)) (= (select |c_#valid| .cse1) 1)))) is different from false [2021-12-14 19:52:00,405 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-14 19:52:00,405 INFO L388 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 2 case distinctions, treesize of input 157 treesize of output 123 [2021-12-14 19:52:00,418 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-14 19:52:00,418 INFO L388 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 2 case distinctions, treesize of input 123 treesize of output 115 [2021-12-14 19:52:00,427 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:00,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 562 treesize of output 538 [2021-12-14 19:52:00,447 INFO L388 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 598 treesize of output 558 [2021-12-14 19:52:00,465 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:00,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 645 treesize of output 641 [2021-12-14 19:52:00,484 INFO L388 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 373 treesize of output 357 [2021-12-14 19:52:00,702 INFO L388 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 226 treesize of output 210 [2021-12-14 19:52:00,786 INFO L388 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 170 treesize of output 154 [2021-12-14 19:52:00,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-14 19:52:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 4 not checked. [2021-12-14 19:52:01,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033745300] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:01,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:01,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2021-12-14 19:52:01,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535675897] [2021-12-14 19:52:01,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:01,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-14 19:52:01,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-14 19:52:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1216, Unknown=4, NotChecked=292, Total=1640 [2021-12-14 19:52:01,310 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 41 states, 40 states have (on average 2.675) internal successors, (107), 41 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 19:52:03,537 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse7)) (.cse5 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (= (select |c_#valid| .cse2) 1))))) (= .cse3 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= .cse3 0)) (not (= 0 .cse4)) (= .cse4 1) (= .cse5 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse7) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse5 0))))) is different from false [2021-12-14 19:52:33,636 WARN L227 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 54 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-14 19:52:35,780 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse7)) (.cse5 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)) (= (select |c_#valid| .cse2) 1))))) (= .cse3 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= .cse3 0)) (not (= 0 .cse4)) (= .cse4 1) (= .cse5 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse7) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= .cse5 0))))) is different from false [2021-12-14 19:52:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:39,992 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-12-14 19:52:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:52:39,992 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.675) internal successors, (107), 41 states have internal predecessors, (107), 0 states have call successors, (0), 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 43 [2021-12-14 19:52:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:39,993 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:52:39,993 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:52:39,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=262, Invalid=2099, Unknown=15, NotChecked=594, Total=2970 [2021-12-14 19:52:39,994 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:39,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 326 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 394 Invalid, 0 Unknown, 321 Unchecked, 0.2s Time] [2021-12-14 19:52:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:52:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-12-14 19:52:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2021-12-14 19:52:39,995 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 43 [2021-12-14 19:52:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:39,995 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2021-12-14 19:52:39,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.675) internal successors, (107), 41 states have internal predecessors, (107), 0 states have call successors, (0), 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-14 19:52:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2021-12-14 19:52:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:52:39,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:39,996 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:40,036 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-14 19:52:40,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 19:52:40,197 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:52:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash -56889648, now seen corresponding path program 1 times [2021-12-14 19:52:40,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:40,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994064099] [2021-12-14 19:52:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:40,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:52:40,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:40,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994064099] [2021-12-14 19:52:40,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994064099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:40,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673613191] [2021-12-14 19:52:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:40,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:40,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:40,629 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-14 19:52:40,630 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-14 19:52:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:40,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-14 19:52:40,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:40,837 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:52:40,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:52:40,879 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:40,880 INFO L388 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 14 [2021-12-14 19:52:40,958 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:52:40,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2021-12-14 19:52:40,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-14 19:52:41,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-14 19:52:41,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:41,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-14 19:52:41,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:41,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-14 19:52:41,066 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:41,066 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-14 19:52:41,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-12-14 19:52:41,168 INFO L388 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 36 treesize of output 36 [2021-12-14 19:52:41,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-14 19:52:41,249 INFO L354 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-12-14 19:52:41,250 INFO L388 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 43 treesize of output 42 [2021-12-14 19:52:41,261 INFO L354 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-12-14 19:52:41,261 INFO L388 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 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-14 19:52:41,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:41,949 INFO L388 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 41 treesize of output 34 [2021-12-14 19:52:41,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:41,954 INFO L388 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 40 treesize of output 33 [2021-12-14 19:52:41,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:41,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-14 19:52:41,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:41,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-14 19:52:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:52:42,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:42,594 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:42,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2021-12-14 19:52:42,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:42,855 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:42,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 98 [2021-12-14 19:52:42,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:42,864 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:42,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 103 [2021-12-14 19:52:42,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:42,875 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:42,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 160 [2021-12-14 19:52:42,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:42,888 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:42,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 275 treesize of output 275 [2021-12-14 19:52:42,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:42,901 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:42,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 390 treesize of output 390 [2021-12-14 19:52:42,932 INFO L388 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 299 treesize of output 291 [2021-12-14 19:52:42,937 INFO L388 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 291 treesize of output 287 [2021-12-14 19:52:42,943 INFO L388 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 287 treesize of output 279 [2021-12-14 19:52:42,948 INFO L388 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 279 treesize of output 263 [2021-12-14 19:52:42,954 INFO L388 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 263 treesize of output 255 [2021-12-14 19:52:42,959 INFO L388 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 255 treesize of output 239 [2021-12-14 19:52:43,558 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:52:43,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2021-12-14 19:52:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:52:43,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673613191] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:43,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:43,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 48 [2021-12-14 19:52:43,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139022732] [2021-12-14 19:52:43,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:43,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-14 19:52:43,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:43,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-14 19:52:43,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2167, Unknown=16, NotChecked=0, Total=2352 [2021-12-14 19:52:43,573 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 49 states, 48 states have (on average 2.3958333333333335) internal successors, (115), 49 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:44,431 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-12-14 19:52:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:52:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.3958333333333335) internal successors, (115), 49 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-14 19:52:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:44,432 INFO L225 Difference]: With dead ends: 83 [2021-12-14 19:52:44,432 INFO L226 Difference]: Without dead ends: 83 [2021-12-14 19:52:44,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=365, Invalid=3401, Unknown=16, NotChecked=0, Total=3782 [2021-12-14 19:52:44,433 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:44,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 365 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 440 Invalid, 0 Unknown, 292 Unchecked, 0.2s Time] [2021-12-14 19:52:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-14 19:52:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2021-12-14 19:52:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2021-12-14 19:52:44,435 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 43 [2021-12-14 19:52:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:44,435 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2021-12-14 19:52:44,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.3958333333333335) internal successors, (115), 49 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2021-12-14 19:52:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:52:44,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:44,436 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:44,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:44,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 19:52:44,643 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:52:44,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1711479191, now seen corresponding path program 1 times [2021-12-14 19:52:44,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:44,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780640791] [2021-12-14 19:52:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:44,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:52:44,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:44,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780640791] [2021-12-14 19:52:44,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780640791] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:44,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348920971] [2021-12-14 19:52:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:44,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:44,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:44,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:44,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:52:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:45,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-14 19:52:45,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:45,150 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:52:45,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:52:45,169 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:45,169 INFO L388 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 14 [2021-12-14 19:52:45,226 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:52:45,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2021-12-14 19:52:45,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-14 19:52:45,272 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-14 19:52:45,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:52:45,284 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:45,284 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-14 19:52:45,322 INFO L388 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 17 treesize of output 19 [2021-12-14 19:52:45,343 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-14 19:52:45,344 INFO L388 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 24 treesize of output 23 [2021-12-14 19:52:45,389 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-14 19:52:45,390 INFO L388 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 22 treesize of output 21 [2021-12-14 19:52:45,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-14 19:52:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:52:45,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:45,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))))) is different from false [2021-12-14 19:52:45,471 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-14 19:52:45,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1845 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-14 19:52:45,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1845 (Array Int Int)) (v_ArrVal_1844 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1844)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1845) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-14 19:52:45,491 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-14 19:52:45,491 INFO L388 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 2 case distinctions, treesize of input 29 treesize of output 35 [2021-12-14 19:52:45,493 INFO L388 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 75 treesize of output 63 [2021-12-14 19:52:45,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-14 19:52:45,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-14 19:52:45,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-14 19:52:45,640 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:52:45,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2021-12-14 19:52:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 13 not checked. [2021-12-14 19:52:45,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348920971] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:45,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:45,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 37 [2021-12-14 19:52:45,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110007713] [2021-12-14 19:52:45,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:45,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-14 19:52:45,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:45,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-14 19:52:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=943, Unknown=4, NotChecked=260, Total=1332 [2021-12-14 19:52:45,654 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 37 states, 37 states have (on average 2.918918918918919) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 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-14 19:52:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:46,265 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2021-12-14 19:52:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 19:52:46,266 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.918918918918919) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 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 46 [2021-12-14 19:52:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:46,266 INFO L225 Difference]: With dead ends: 95 [2021-12-14 19:52:46,266 INFO L226 Difference]: Without dead ends: 95 [2021-12-14 19:52:46,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=386, Invalid=1606, Unknown=4, NotChecked=356, Total=2352 [2021-12-14 19:52:46,267 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 349 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:46,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 389 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 515 Invalid, 0 Unknown, 306 Unchecked, 0.2s Time] [2021-12-14 19:52:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-14 19:52:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2021-12-14 19:52:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-12-14 19:52:46,269 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 46 [2021-12-14 19:52:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:46,269 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-12-14 19:52:46,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.918918918918919) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 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-14 19:52:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-12-14 19:52:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:52:46,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:46,269 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:46,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:46,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 19:52:46,470 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2021-12-14 19:52:46,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:46,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1712591067, now seen corresponding path program 1 times [2021-12-14 19:52:46,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:46,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314473517] [2021-12-14 19:52:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:46,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:47,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:47,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314473517] [2021-12-14 19:52:47,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314473517] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:47,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067133007] [2021-12-14 19:52:47,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:47,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:47,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:47,050 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:47,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:52:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:47,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-14 19:52:47,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:47,393 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:52:47,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:52:47,529 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-14 19:52:47,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-14 19:52:47,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-14 19:52:47,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:52:47,868 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-14 19:52:47,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-12-14 19:52:47,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:52:47,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:52:47,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-14 19:52:48,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:52:48,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-14 19:52:48,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-14 19:52:48,040 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:48,040 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2021-12-14 19:52:48,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-14 19:52:48,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2021-12-14 19:52:48,174 INFO L388 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 45 treesize of output 32 [2021-12-14 19:52:48,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-14 19:52:48,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-14 19:52:48,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:48,251 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:52:48,251 INFO L388 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 54 treesize of output 44 [2021-12-14 19:52:48,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-14 19:52:48,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-14 19:52:48,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,437 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:52:48,437 INFO L388 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 50 [2021-12-14 19:52:48,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:48,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-14 19:52:48,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:52:48,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:48,509 INFO L354 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2021-12-14 19:52:48,509 INFO L388 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 71 treesize of output 39 [2021-12-14 19:52:48,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:48,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2021-12-14 19:52:48,617 INFO L388 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-14 19:52:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:48,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:49,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2122 Int) (v_ArrVal_2120 (Array Int Int)) (v_ArrVal_2119 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2119) .cse3)) (.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_ArrVal_2122) .cse3))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2109) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2120) .cse0) .cse1)) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| .cse1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)))))) is different from false [2021-12-14 19:52:49,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2122 Int) (v_ArrVal_2120 (Array Int Int)) (v_ArrVal_2119 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2122) .cse3)) (.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2119) .cse3))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2109) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2120) .cse0) .cse1)) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) is different from false [2021-12-14 19:52:49,403 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-14 19:52:49,403 INFO L388 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 2 case distinctions, treesize of input 241 treesize of output 207 [2021-12-14 19:52:49,415 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:49,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1529 treesize of output 1515 [2021-12-14 19:52:49,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:49,431 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:49,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1499 treesize of output 1179 [2021-12-14 19:52:49,454 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:49,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9055 treesize of output 8879 [2021-12-14 19:52:49,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:49,504 INFO L388 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 9928 treesize of output 9668 [2021-12-14 19:52:49,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:49,548 INFO L388 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 10467 treesize of output 10047