./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.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 c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 22:22:42,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 22:22:42,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 22:22:42,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 22:22:42,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 22:22:42,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 22:22:42,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 22:22:42,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 22:22:42,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 22:22:42,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 22:22:42,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 22:22:42,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 22:22:42,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 22:22:42,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 22:22:42,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 22:22:42,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 22:22:42,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 22:22:42,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 22:22:42,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 22:22:42,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 22:22:42,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 22:22:42,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 22:22:42,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 22:22:42,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 22:22:42,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 22:22:42,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 22:22:42,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 22:22:42,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 22:22:42,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 22:22:42,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 22:22:42,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 22:22:42,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 22:22:42,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 22:22:42,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 22:22:42,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 22:22:42,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 22:22:42,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 22:22:42,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 22:22:42,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 22:22:42,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 22:22:42,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 22:22:42,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 22:22:42,508 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 22:22:42,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 22:22:42,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 22:22:42,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 22:22:42,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 22:22:42,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 22:22:42,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 22:22:42,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 22:22:42,510 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 22:22:42,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 22:22:42,518 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 22:22:42,519 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 22:22:42,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 22:22:42,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 22:22:42,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 22:22:42,519 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 22:22:42,519 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 22:22:42,520 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 22:22:42,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 22:22:42,520 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 22:22:42,520 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 22:22:42,520 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 22:22:42,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 22:22:42,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 22:22:42,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 22:22:42,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:22:42,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 22:22:42,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 22:22:42,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 22:22:42,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 22:22:42,522 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 22:22:42,522 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2021-12-18 22:22:42,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 22:22:42,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 22:22:42,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 22:22:42,788 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 22:22:42,788 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 22:22:42,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2021-12-18 22:22:42,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643ea74b1/66cabd49ce9a4c30bdd0b9b2273722c4/FLAGec848d4c8 [2021-12-18 22:22:43,217 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 22:22:43,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2021-12-18 22:22:43,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643ea74b1/66cabd49ce9a4c30bdd0b9b2273722c4/FLAGec848d4c8 [2021-12-18 22:22:43,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643ea74b1/66cabd49ce9a4c30bdd0b9b2273722c4 [2021-12-18 22:22:43,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 22:22:43,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 22:22:43,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 22:22:43,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 22:22:43,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 22:22:43,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1edc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43, skipping insertion in model container [2021-12-18 22:22:43,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 22:22:43,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 22:22:43,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2021-12-18 22:22:43,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:22:43,494 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 22:22:43,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2021-12-18 22:22:43,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:22:43,538 INFO L208 MainTranslator]: Completed translation [2021-12-18 22:22:43,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43 WrapperNode [2021-12-18 22:22:43,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 22:22:43,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 22:22:43,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 22:22:43,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 22:22:43,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,571 INFO L137 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2021-12-18 22:22:43,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 22:22:43,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 22:22:43,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 22:22:43,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 22:22:43,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 22:22:43,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 22:22:43,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 22:22:43,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 22:22:43,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (1/1) ... [2021-12-18 22:22:43,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:22:43,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:22:43,667 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-18 22:22:43,684 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-18 22:22:43,707 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-18 22:22:43,712 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-18 22:22:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 22:22:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 22:22:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 22:22:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 22:22:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 22:22:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 22:22:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 22:22:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 22:22:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 22:22:43,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 22:22:43,837 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 22:22:43,838 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 22:22:43,889 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-18 22:22:44,057 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 22:22:44,062 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 22:22:44,062 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-18 22:22:44,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:22:44 BoogieIcfgContainer [2021-12-18 22:22:44,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 22:22:44,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 22:22:44,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 22:22:44,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 22:22:44,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:22:43" (1/3) ... [2021-12-18 22:22:44,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edef733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:22:44, skipping insertion in model container [2021-12-18 22:22:44,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:22:43" (2/3) ... [2021-12-18 22:22:44,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edef733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:22:44, skipping insertion in model container [2021-12-18 22:22:44,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:22:44" (3/3) ... [2021-12-18 22:22:44,071 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2021-12-18 22:22:44,075 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 22:22:44,075 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-12-18 22:22:44,112 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 22:22:44,117 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-18 22:22:44,118 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-12-18 22:22:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 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-18 22:22:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-18 22:22:44,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:44,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-18 22:22:44,145 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-18 22:22:44,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:44,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473446222] [2021-12-18 22:22:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:44,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:44,270 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-18 22:22:44,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:44,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473446222] [2021-12-18 22:22:44,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473446222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:44,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:44,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:22:44,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859722462] [2021-12-18 22:22:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:44,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:22:44,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:44,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:22:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:22:44,299 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 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-18 22:22:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:44,384 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-18 22:22:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:22:44,386 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-18 22:22:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:44,390 INFO L225 Difference]: With dead ends: 76 [2021-12-18 22:22:44,390 INFO L226 Difference]: Without dead ends: 70 [2021-12-18 22:22:44,392 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-18 22:22:44,394 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:44,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:44,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-18 22:22:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2021-12-18 22:22:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 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-18 22:22:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-12-18 22:22:44,417 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2021-12-18 22:22:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:44,418 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-12-18 22:22:44,418 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-18 22:22:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-12-18 22:22:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-18 22:22:44,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:44,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-18 22:22:44,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 22:22:44,419 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-18 22:22:44,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:44,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377088009] [2021-12-18 22:22:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:44,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:44,451 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-18 22:22:44,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:44,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377088009] [2021-12-18 22:22:44,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377088009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:44,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:44,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:22:44,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963250438] [2021-12-18 22:22:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:44,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:22:44,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:22:44,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:22:44,455 INFO L87 Difference]: Start difference. First operand 54 states and 57 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-18 22:22:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:44,480 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-12-18 22:22:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:22:44,481 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-18 22:22:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:44,482 INFO L225 Difference]: With dead ends: 51 [2021-12-18 22:22:44,482 INFO L226 Difference]: Without dead ends: 51 [2021-12-18 22:22:44,482 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-18 22:22:44,483 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:44,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-18 22:22:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-18 22:22:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.6875) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-12-18 22:22:44,487 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2021-12-18 22:22:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:44,488 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-12-18 22:22:44,488 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-18 22:22:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-12-18 22:22:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 22:22:44,489 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:44,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:44,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 22:22:44,489 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2021-12-18 22:22:44,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:44,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388135899] [2021-12-18 22:22:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:44,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:44,521 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-18 22:22:44,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:44,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388135899] [2021-12-18 22:22:44,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388135899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:44,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:44,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:22:44,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012344251] [2021-12-18 22:22:44,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:44,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:22:44,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:44,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:22:44,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:22:44,524 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:44,565 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-12-18 22:22:44,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:22:44,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 22:22:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:44,567 INFO L225 Difference]: With dead ends: 82 [2021-12-18 22:22:44,567 INFO L226 Difference]: Without dead ends: 82 [2021-12-18 22:22:44,567 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-18 22:22:44,568 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:44,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-18 22:22:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2021-12-18 22:22:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-12-18 22:22:44,573 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2021-12-18 22:22:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:44,573 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-12-18 22:22:44,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-12-18 22:22:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 22:22:44,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:44,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:44,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 22:22:44,574 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2021-12-18 22:22:44,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:44,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471109031] [2021-12-18 22:22:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:44,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:44,609 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-18 22:22:44,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471109031] [2021-12-18 22:22:44,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471109031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:44,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:44,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:22:44,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520958818] [2021-12-18 22:22:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:44,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:22:44,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:44,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:22:44,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:22:44,612 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:44,648 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2021-12-18 22:22:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:22:44,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 22:22:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:44,649 INFO L225 Difference]: With dead ends: 84 [2021-12-18 22:22:44,649 INFO L226 Difference]: Without dead ends: 84 [2021-12-18 22:22:44,649 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-18 22:22:44,650 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:44,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-18 22:22:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2021-12-18 22:22:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2021-12-18 22:22:44,655 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2021-12-18 22:22:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:44,655 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2021-12-18 22:22:44,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2021-12-18 22:22:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 22:22:44,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:44,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:44,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 22:22:44,656 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:44,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2021-12-18 22:22:44,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:44,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836880712] [2021-12-18 22:22:44,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:44,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:44,687 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-18 22:22:44,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:44,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836880712] [2021-12-18 22:22:44,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836880712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:44,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:44,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 22:22:44,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561443460] [2021-12-18 22:22:44,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:44,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:22:44,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:22:44,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:22:44,689 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:44,695 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-12-18 22:22:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:22:44,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 22:22:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:44,712 INFO L225 Difference]: With dead ends: 52 [2021-12-18 22:22:44,713 INFO L226 Difference]: Without dead ends: 52 [2021-12-18 22:22:44,713 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-18 22:22:44,714 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 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-18 22:22:44,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-18 22:22:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2021-12-18 22:22:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2021-12-18 22:22:44,718 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 11 [2021-12-18 22:22:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:44,718 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2021-12-18 22:22:44,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2021-12-18 22:22:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 22:22:44,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:44,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:44,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 22:22:44,719 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:44,720 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2021-12-18 22:22:44,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:44,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236595424] [2021-12-18 22:22:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:44,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:44,763 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-18 22:22:44,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:44,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236595424] [2021-12-18 22:22:44,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236595424] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:22:44,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880633289] [2021-12-18 22:22:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:44,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:22:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:22:44,765 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-18 22:22:44,766 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-18 22:22:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:44,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:22:44,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:44,887 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-18 22:22:44,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:44,924 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-18 22:22:44,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880633289] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:44,925 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:22:44,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-18 22:22:44,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351797626] [2021-12-18 22:22:44,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:44,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:22:44,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:44,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:22:44,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:22:44,926 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:44,941 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-12-18 22:22:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:22:44,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-18 22:22:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:44,942 INFO L225 Difference]: With dead ends: 63 [2021-12-18 22:22:44,942 INFO L226 Difference]: Without dead ends: 63 [2021-12-18 22:22:44,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:22:44,943 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:44,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:22:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-18 22:22:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-18 22:22:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 62 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-18 22:22:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2021-12-18 22:22:44,946 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 16 [2021-12-18 22:22:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:44,946 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2021-12-18 22:22:44,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2021-12-18 22:22:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-18 22:22:44,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:44,947 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:44,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 22:22:45,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-18 22:22:45,165 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2021-12-18 22:22:45,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:45,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163494061] [2021-12-18 22:22:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:45,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-18 22:22:45,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:45,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163494061] [2021-12-18 22:22:45,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163494061] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:45,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:45,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:22:45,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344522072] [2021-12-18 22:22:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:45,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:22:45,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:45,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:22:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:22:45,259 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:45,356 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-12-18 22:22:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:22:45,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-18 22:22:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:45,357 INFO L225 Difference]: With dead ends: 75 [2021-12-18 22:22:45,358 INFO L226 Difference]: Without dead ends: 75 [2021-12-18 22:22:45,358 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-18 22:22:45,359 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:45,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-18 22:22:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2021-12-18 22:22:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) 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-18 22:22:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-12-18 22:22:45,363 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2021-12-18 22:22:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:45,363 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-12-18 22:22:45,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-12-18 22:22:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-18 22:22:45,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:45,364 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:45,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 22:22:45,365 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2021-12-18 22:22:45,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:45,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378307365] [2021-12-18 22:22:45,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:45,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:22:45,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:45,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378307365] [2021-12-18 22:22:45,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378307365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:22:45,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:22:45,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 22:22:45,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154589979] [2021-12-18 22:22:45,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:22:45,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:22:45,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:45,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:22:45,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:22:45,437 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:45,537 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-12-18 22:22:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:22:45,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-18 22:22:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:45,538 INFO L225 Difference]: With dead ends: 66 [2021-12-18 22:22:45,538 INFO L226 Difference]: Without dead ends: 66 [2021-12-18 22:22:45,538 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-18 22:22:45,539 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:45,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 47 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:22:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-18 22:22:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2021-12-18 22:22:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 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-18 22:22:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-12-18 22:22:45,542 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2021-12-18 22:22:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:45,542 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-12-18 22:22:45,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-12-18 22:22:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 22:22:45,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:45,543 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:45,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 22:22:45,543 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 142544431, now seen corresponding path program 1 times [2021-12-18 22:22:45,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:45,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439100323] [2021-12-18 22:22:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:45,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:22:45,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439100323] [2021-12-18 22:22:45,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439100323] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:22:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883673796] [2021-12-18 22:22:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:45,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:22:45,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:22:45,789 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-18 22:22:45,826 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-18 22:22:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:45,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 22:22:45,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:46,110 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 22:22:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:46,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 21 treesize of output 20 [2021-12-18 22:22:46,235 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 19 treesize of output 7 [2021-12-18 22:22:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:22:46,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:47,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2021-12-18 22:22:48,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2021-12-18 22:22:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 7 not checked. [2021-12-18 22:22:48,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883673796] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:48,500 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:22:48,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-18 22:22:48,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050200958] [2021-12-18 22:22:48,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:48,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-18 22:22:48,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-18 22:22:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=446, Unknown=2, NotChecked=86, Total=600 [2021-12-18 22:22:48,501 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:48,895 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-18 22:22:49,278 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2021-12-18 22:22:49,633 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((v_ArrVal_432 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_432)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2021-12-18 22:22:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:49,793 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-12-18 22:22:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:22:49,794 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-18 22:22:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:49,795 INFO L225 Difference]: With dead ends: 63 [2021-12-18 22:22:49,795 INFO L226 Difference]: Without dead ends: 63 [2021-12-18 22:22:49,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=129, Invalid=698, Unknown=5, NotChecked=290, Total=1122 [2021-12-18 22:22:49,795 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:49,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 473 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2021-12-18 22:22:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-18 22:22:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-18 22:22:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 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-18 22:22:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2021-12-18 22:22:49,799 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2021-12-18 22:22:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:49,799 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2021-12-18 22:22:49,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:22:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2021-12-18 22:22:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:22:49,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:49,800 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:49,819 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-18 22:22:50,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-18 22:22:50,017 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2021-12-18 22:22:50,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:50,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494898202] [2021-12-18 22:22:50,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:50,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 22:22:50,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494898202] [2021-12-18 22:22:50,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494898202] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:22:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900943138] [2021-12-18 22:22:50,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:50,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:22:50,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:22:50,257 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-18 22:22:50,259 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-18 22:22:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:50,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-18 22:22:50,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:50,433 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-18 22:22:50,476 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:22:50,476 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 18 [2021-12-18 22:22:50,520 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 22:22:50,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:50,541 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 31 treesize of output 26 [2021-12-18 22:22:50,615 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-18 22:22:50,615 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 29 treesize of output 28 [2021-12-18 22:22:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:50,788 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:22:50,789 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 34 treesize of output 35 [2021-12-18 22:22:50,821 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:22:50,821 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2021-12-18 22:22:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:22:50,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:22:51,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900943138] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:22:51,078 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:22:51,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 25 [2021-12-18 22:22:51,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077813741] [2021-12-18 22:22:51,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:22:51,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 22:22:51,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:22:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 22:22:51,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2021-12-18 22:22:51,080 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 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-18 22:22:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:22:51,477 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2021-12-18 22:22:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 22:22:51,478 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-18 22:22:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:22:51,478 INFO L225 Difference]: With dead ends: 75 [2021-12-18 22:22:51,478 INFO L226 Difference]: Without dead ends: 75 [2021-12-18 22:22:51,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2021-12-18 22:22:51,479 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:22:51,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 222 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 499 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2021-12-18 22:22:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-18 22:22:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2021-12-18 22:22:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 67 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-18 22:22:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-12-18 22:22:51,482 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 37 [2021-12-18 22:22:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:22:51,482 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-12-18 22:22:51,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 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-18 22:22:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-12-18 22:22:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:22:51,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:22:51,483 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:22:51,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-18 22:22:51,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:22:51,694 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:22:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:22:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2021-12-18 22:22:51,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:22:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678929126] [2021-12-18 22:22:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:51,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:22:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:22:51,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:22:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678929126] [2021-12-18 22:22:51,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678929126] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:22:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176586669] [2021-12-18 22:22:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:22:51,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:22:51,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:22:51,966 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-18 22:22:51,983 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-18 22:22:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:22:52,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-18 22:22:52,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:22:52,119 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-18 22:22:52,179 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:22:52,179 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 18 [2021-12-18 22:22:52,225 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 22:22:52,230 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 22:22:52,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:52,267 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-18 22:22:52,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:52,272 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 31 treesize of output 26 [2021-12-18 22:22:52,325 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-18 22:22:52,325 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 29 treesize of output 28 [2021-12-18 22:22:52,334 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 22:22:52,334 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 19 treesize of output 18 [2021-12-18 22:22:53,045 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-12-18 22:22:53,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 69 [2021-12-18 22:22:53,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:22:53,053 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:22:53,053 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 61 treesize of output 46 [2021-12-18 22:22:53,100 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-12-18 22:22:53,100 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 74 treesize of output 48 [2021-12-18 22:22:53,123 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-12-18 22:22:53,123 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 44 treesize of output 30 [2021-12-18 22:22:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:22:53,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:22:55,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-18 22:22:57,571 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) is different from false [2021-12-18 22:22:59,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_777 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_ArrVal_777)))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_ArrVal_780)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) is different from false [2021-12-18 22:23:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-12-18 22:23:01,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176586669] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:23:01,254 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:23:01,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2021-12-18 22:23:01,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646152260] [2021-12-18 22:23:01,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:23:01,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-18 22:23:01,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:23:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-18 22:23:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=775, Unknown=4, NotChecked=174, Total=1056 [2021-12-18 22:23:01,256 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 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-18 22:23:03,401 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (and (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (<= (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((v_ArrVal_780 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_777 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_777)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_780)))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= 0 (+ .cse1 4)) (<= (+ .cse1 8) (select |c_#length| .cse2))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (<= 8 (select |c_#length| .cse6)) (= .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) .cse0 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-12-18 22:23:05,405 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (<= (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (<= 8 (select |c_#length| .cse2)) (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-18 22:23:07,408 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (<= 8 (select |c_#length| .cse0)))) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse1 4)) (<= (+ .cse1 8) (select |c_#length| .cse2))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-18 22:23:09,422 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (<= 8 (select |c_#length| .cse0)))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse1 4)) (<= (+ .cse1 8) (select |c_#length| .cse2))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-18 22:23:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:09,569 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-12-18 22:23:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 22:23:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-18 22:23:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:09,570 INFO L225 Difference]: With dead ends: 84 [2021-12-18 22:23:09,570 INFO L226 Difference]: Without dead ends: 84 [2021-12-18 22:23:09,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=135, Invalid=941, Unknown=8, NotChecked=476, Total=1560 [2021-12-18 22:23:09,571 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 105 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:09,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 276 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 448 Invalid, 0 Unknown, 208 Unchecked, 0.2s Time] [2021-12-18 22:23:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-18 22:23:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2021-12-18 22:23:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.265625) internal successors, (81), 73 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-18 22:23:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-12-18 22:23:09,574 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 37 [2021-12-18 22:23:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:09,574 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-12-18 22:23:09,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 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-18 22:23:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-12-18 22:23:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 22:23:09,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:09,575 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:23:09,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-18 22:23:09,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:23:09,775 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:23:09,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327534, now seen corresponding path program 1 times [2021-12-18 22:23:09,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:23:09,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130658540] [2021-12-18 22:23:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:09,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:23:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-18 22:23:09,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:23:09,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130658540] [2021-12-18 22:23:09,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130658540] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:23:09,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:23:09,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 22:23:09,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500864833] [2021-12-18 22:23:09,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:23:09,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:23:09,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:23:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:23:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:23:09,928 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:23:10,063 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2021-12-18 22:23:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:23:10,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-18 22:23:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:23:10,064 INFO L225 Difference]: With dead ends: 85 [2021-12-18 22:23:10,064 INFO L226 Difference]: Without dead ends: 85 [2021-12-18 22:23:10,064 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-18 22:23:10,064 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 197 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:23:10,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 46 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:23:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-18 22:23:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2021-12-18 22:23:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-18 22:23:10,067 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 38 [2021-12-18 22:23:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:23:10,067 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-18 22:23:10,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:23:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-18 22:23:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 22:23:10,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:23:10,068 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:23:10,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 22:23:10,068 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:23:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:23:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash -494379329, now seen corresponding path program 1 times [2021-12-18 22:23:10,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:23:10,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393209096] [2021-12-18 22:23:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:10,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:23:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:23:10,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:23:10,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393209096] [2021-12-18 22:23:10,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393209096] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:23:10,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628069910] [2021-12-18 22:23:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:23:10,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:23:10,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:23:10,632 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-18 22:23:10,642 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-18 22:23:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:23:10,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-18 22:23:10,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:23:11,045 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 22:23:11,164 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 22:23:11,168 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 22:23:11,180 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-18 22:23:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2021-12-18 22:23:11,186 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 5 treesize of output 3 [2021-12-18 22:23:11,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:11,233 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-18 22:23:11,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:11,241 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 33 treesize of output 28 [2021-12-18 22:23:11,250 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-18 22:23:11,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 26 treesize of output 36 [2021-12-18 22:23:11,357 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-18 22:23:11,357 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 31 treesize of output 30 [2021-12-18 22:23:11,362 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 23 treesize of output 22 [2021-12-18 22:23:11,371 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 22:23:11,371 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 19 treesize of output 18 [2021-12-18 22:23:11,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:23:11,661 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 22:23:11,661 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 75 treesize of output 56 [2021-12-18 22:23:11,677 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-12-18 22:23:11,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 71 [2021-12-18 22:23:11,689 INFO L354 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2021-12-18 22:23:11,690 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 46 treesize of output 64 [2021-12-18 22:23:11,694 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-18 22:23:11,796 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-12-18 22:23:11,796 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 69 treesize of output 43 [2021-12-18 22:23:11,805 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-12-18 22:23:11,805 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 33 treesize of output 19 [2021-12-18 22:23:11,917 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-18 22:23:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 22:23:11,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:23:12,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 Int) (v_ArrVal_1053 Int) (v_ArrVal_1056 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1054 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1056) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1053) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1051)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1054) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) is different from false [2021-12-18 22:23:12,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 Int) (v_ArrVal_1053 Int) (v_ArrVal_1056 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1054 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1053) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1056) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1051)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1054) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) is different from false [2021-12-18 22:23:12,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 Int) (v_ArrVal_1053 Int) (v_ArrVal_1043 Int) (v_ArrVal_1045 Int) (v_ArrVal_1056 Int) (v_ArrVal_1044 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1054 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1043)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1053) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1045)))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1056) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1044))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1051))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1054) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2021-12-18 22:23:12,498 INFO L354 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2021-12-18 22:23:12,498 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 3 case distinctions, treesize of input 206 treesize of output 176 [2021-12-18 22:23:12,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:12,511 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 204 [2021-12-18 22:23:12,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:23:12,544 INFO L354 Elim1Store]: treesize reduction 54, result has 45.5 percent of original size [2021-12-18 22:23:12,544 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 3 case distinctions, treesize of input 162 treesize of output 122 [2021-12-18 22:23:12,554 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:12,555 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 122 treesize of output 114 [2021-12-18 22:23:12,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:23:12,633 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 66 treesize of output 60 [2021-12-18 22:23:12,722 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 6 treesize of output 4 [2021-12-18 22:23:12,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:23:12,743 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:23:12,744 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 163 treesize of output 143 [2021-12-18 22:23:12,766 INFO L354 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2021-12-18 22:23:12,766 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 241 treesize of output 243 [2021-12-18 22:23:13,023 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 7 treesize of output 3 [2021-12-18 22:23:13,170 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 7 treesize of output 3 [2021-12-18 22:23:13,275 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 7 treesize of output 3 Killed by 15