./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:18:41,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:18:41,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:18:41,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:18:41,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:18:41,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:18:41,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:18:41,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:18:41,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:18:41,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:18:41,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:18:41,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:18:41,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:18:41,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:18:41,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:18:41,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:18:41,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:18:41,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:18:41,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:18:41,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:18:41,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:18:41,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:18:41,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:18:41,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:18:41,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:18:41,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:18:41,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:18:41,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:18:41,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:18:41,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:18:41,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:18:41,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:18:41,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:18:41,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:18:41,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:18:41,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:18:41,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:18:41,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:18:41,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:18:41,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:18:41,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:18:41,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-21 18:18:41,616 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:18:41,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:18:41,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:18:41,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:18:41,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:18:41,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:18:41,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:18:41,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:18:41,618 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:18:41,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:18:41,619 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:18:41,619 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:18:41,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:18:41,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:18:41,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:18:41,620 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:18:41,620 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:18:41,620 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:18:41,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:18:41,620 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:18:41,621 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:18:41,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:18:41,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:18:41,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:18:41,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:18:41,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:18:41,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:18:41,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:18:41,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:18:41,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:18:41,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:18:41,623 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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2021-12-21 18:18:41,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:18:41,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:18:41,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:18:41,807 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:18:41,807 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:18:41,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2021-12-21 18:18:41,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fab1f20/9af464dd73bd4c92b64dfece334e08bb/FLAG37eb11057 [2021-12-21 18:18:42,227 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:18:42,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2021-12-21 18:18:42,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fab1f20/9af464dd73bd4c92b64dfece334e08bb/FLAG37eb11057 [2021-12-21 18:18:42,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fab1f20/9af464dd73bd4c92b64dfece334e08bb [2021-12-21 18:18:42,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:18:42,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:18:42,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:18:42,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:18:42,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:18:42,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c14538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42, skipping insertion in model container [2021-12-21 18:18:42,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:18:42,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:18:42,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:18:42,480 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:18:42,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:18:42,520 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:18:42,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42 WrapperNode [2021-12-21 18:18:42,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:18:42,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:18:42,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:18:42,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:18:42,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,557 INFO L137 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2021-12-21 18:18:42,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:18:42,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:18:42,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:18:42,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:18:42,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:18:42,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:18:42,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:18:42,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:18:42,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (1/1) ... [2021-12-21 18:18:42,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:18:42,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:42,633 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-21 18:18:42,645 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-21 18:18:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-21 18:18:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-21 18:18:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:18:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:18:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:18:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:18:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:18:42,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:18:42,744 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:18:42,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:18:42,771 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-21 18:18:43,002 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:18:43,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:18:43,016 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 18:18:43,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:18:43 BoogieIcfgContainer [2021-12-21 18:18:43,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:18:43,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:18:43,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:18:43,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:18:43,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:18:42" (1/3) ... [2021-12-21 18:18:43,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2520c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:18:43, skipping insertion in model container [2021-12-21 18:18:43,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:42" (2/3) ... [2021-12-21 18:18:43,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2520c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:18:43, skipping insertion in model container [2021-12-21 18:18:43,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:18:43" (3/3) ... [2021-12-21 18:18:43,025 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2021-12-21 18:18:43,030 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:18:43,030 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2021-12-21 18:18:43,058 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:18:43,063 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-21 18:18:43,063 INFO L340 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2021-12-21 18:18:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 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-21 18:18:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 18:18:43,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:43,079 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 18:18:43,079 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:43,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-21 18:18:43,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:43,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806267269] [2021-12-21 18:18:43,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:43,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:43,219 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-21 18:18:43,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:43,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806267269] [2021-12-21 18:18:43,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806267269] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:43,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:43,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:18:43,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951688260] [2021-12-21 18:18:43,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:43,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:43,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:43,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:43,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:43,251 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 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-21 18:18:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:43,368 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2021-12-21 18:18:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:43,370 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-21 18:18:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:43,379 INFO L225 Difference]: With dead ends: 136 [2021-12-21 18:18:43,380 INFO L226 Difference]: Without dead ends: 130 [2021-12-21 18:18:43,382 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-21 18:18:43,385 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:43,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-21 18:18:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-21 18:18:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 0 states have call successors, (0), 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-21 18:18:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2021-12-21 18:18:43,428 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2021-12-21 18:18:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:43,429 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2021-12-21 18:18:43,429 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-21 18:18:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2021-12-21 18:18:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 18:18:43,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:43,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 18:18:43,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 18:18:43,430 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-21 18:18:43,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:43,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110050115] [2021-12-21 18:18:43,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:43,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:43,491 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-21 18:18:43,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:43,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110050115] [2021-12-21 18:18:43,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110050115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:43,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:43,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:18:43,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279015893] [2021-12-21 18:18:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:43,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:43,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:43,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:43,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:43,495 INFO L87 Difference]: Start difference. First operand 130 states and 135 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-21 18:18:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:43,529 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-12-21 18:18:43,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:43,530 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-21 18:18:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:43,531 INFO L225 Difference]: With dead ends: 127 [2021-12-21 18:18:43,531 INFO L226 Difference]: Without dead ends: 127 [2021-12-21 18:18:43,532 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-21 18:18:43,532 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:43,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-21 18:18:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-21 18:18:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-12-21 18:18:43,538 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2021-12-21 18:18:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:43,538 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-12-21 18:18:43,538 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-21 18:18:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-12-21 18:18:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:18:43,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:43,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:43,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 18:18:43,539 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2021-12-21 18:18:43,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:43,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655360074] [2021-12-21 18:18:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:43,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:43,582 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-21 18:18:43,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:43,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655360074] [2021-12-21 18:18:43,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655360074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:43,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:43,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:18:43,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664532373] [2021-12-21 18:18:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:43,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:43,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:43,584 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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-21 18:18:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:43,592 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2021-12-21 18:18:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:43,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-21 18:18:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:43,593 INFO L225 Difference]: With dead ends: 136 [2021-12-21 18:18:43,594 INFO L226 Difference]: Without dead ends: 136 [2021-12-21 18:18:43,594 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-21 18:18:43,595 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 254 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-21 18:18:43,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-21 18:18:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2021-12-21 18:18:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 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-21 18:18:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2021-12-21 18:18:43,601 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2021-12-21 18:18:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:43,601 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2021-12-21 18:18:43,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-21 18:18:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2021-12-21 18:18:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:18:43,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:43,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:43,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 18:18:43,602 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2021-12-21 18:18:43,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:43,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890306500] [2021-12-21 18:18:43,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:43,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:43,657 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-21 18:18:43,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:43,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890306500] [2021-12-21 18:18:43,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890306500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:43,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:43,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:18:43,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738371425] [2021-12-21 18:18:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:43,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:43,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:43,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:43,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:43,659 INFO L87 Difference]: Start difference. First operand 128 states and 133 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-21 18:18:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:43,722 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-12-21 18:18:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:43,723 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-21 18:18:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:43,724 INFO L225 Difference]: With dead ends: 127 [2021-12-21 18:18:43,724 INFO L226 Difference]: Without dead ends: 127 [2021-12-21 18:18:43,724 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-21 18:18:43,725 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:43,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-21 18:18:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-21 18:18:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-12-21 18:18:43,730 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2021-12-21 18:18:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:43,730 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-12-21 18:18:43,730 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-21 18:18:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-12-21 18:18:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:18:43,731 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:43,731 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:43,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 18:18:43,731 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2021-12-21 18:18:43,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:43,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451864298] [2021-12-21 18:18:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:43,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:43,760 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-21 18:18:43,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:43,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451864298] [2021-12-21 18:18:43,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451864298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:43,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:43,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:18:43,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130456709] [2021-12-21 18:18:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:43,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:43,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:43,762 INFO L87 Difference]: Start difference. First operand 127 states and 132 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-21 18:18:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:43,776 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2021-12-21 18:18:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:43,777 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-21 18:18:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:43,778 INFO L225 Difference]: With dead ends: 126 [2021-12-21 18:18:43,778 INFO L226 Difference]: Without dead ends: 126 [2021-12-21 18:18:43,778 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-21 18:18:43,779 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:43,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-21 18:18:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-21 18:18:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2021-12-21 18:18:43,783 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2021-12-21 18:18:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:43,783 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2021-12-21 18:18:43,783 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-21 18:18:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2021-12-21 18:18:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:18:43,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:43,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:43,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 18:18:43,784 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2021-12-21 18:18:43,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:43,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517391391] [2021-12-21 18:18:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:43,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:43,828 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-21 18:18:43,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:43,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517391391] [2021-12-21 18:18:43,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517391391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:43,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:43,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:18:43,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832282998] [2021-12-21 18:18:43,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:43,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:18:43,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:43,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:18:43,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:18:43,830 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:43,907 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-12-21 18:18:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:18:43,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-21 18:18:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:43,909 INFO L225 Difference]: With dead ends: 130 [2021-12-21 18:18:43,909 INFO L226 Difference]: Without dead ends: 130 [2021-12-21 18:18:43,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:18:43,911 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:43,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 217 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-21 18:18:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-12-21 18:18:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 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-21 18:18:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2021-12-21 18:18:43,928 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2021-12-21 18:18:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:43,929 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2021-12-21 18:18:43,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2021-12-21 18:18:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:18:43,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:43,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:43,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 18:18:43,930 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2021-12-21 18:18:43,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:43,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010714103] [2021-12-21 18:18:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:43,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:43,990 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-21 18:18:43,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:43,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010714103] [2021-12-21 18:18:43,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010714103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:43,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:43,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:18:43,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995015966] [2021-12-21 18:18:43,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:43,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:18:43,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:43,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:18:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:18:43,997 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:44,067 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-12-21 18:18:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:18:44,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-21 18:18:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:44,068 INFO L225 Difference]: With dead ends: 130 [2021-12-21 18:18:44,068 INFO L226 Difference]: Without dead ends: 130 [2021-12-21 18:18:44,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:18:44,070 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 132 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:44,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 263 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-21 18:18:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-12-21 18:18:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2021-12-21 18:18:44,087 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2021-12-21 18:18:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:44,087 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2021-12-21 18:18:44,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2021-12-21 18:18:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 18:18:44,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:44,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:44,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 18:18:44,088 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2021-12-21 18:18:44,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:44,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938512272] [2021-12-21 18:18:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:44,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:44,148 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-21 18:18:44,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:44,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938512272] [2021-12-21 18:18:44,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938512272] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:44,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426080958] [2021-12-21 18:18:44,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:44,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:44,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:44,151 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-21 18:18:44,152 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-21 18:18:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:44,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:18:44,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:44,295 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-21 18:18:44,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:44,332 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-21 18:18:44,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426080958] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:44,332 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:44,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-21 18:18:44,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589174775] [2021-12-21 18:18:44,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:44,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:18:44,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:18:44,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:18:44,335 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:44,347 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2021-12-21 18:18:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:18:44,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-21 18:18:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:44,350 INFO L225 Difference]: With dead ends: 131 [2021-12-21 18:18:44,350 INFO L226 Difference]: Without dead ends: 131 [2021-12-21 18:18:44,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:18:44,351 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 14 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:44,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 489 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-21 18:18:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-21 18:18:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 0 states have call successors, (0), 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-21 18:18:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2021-12-21 18:18:44,358 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 14 [2021-12-21 18:18:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:44,358 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2021-12-21 18:18:44,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2021-12-21 18:18:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:18:44,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:44,359 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:44,378 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-21 18:18:44,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:44,565 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:44,565 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2021-12-21 18:18:44,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:44,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085386289] [2021-12-21 18:18:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:44,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:44,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:44,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085386289] [2021-12-21 18:18:44,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085386289] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:44,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821490022] [2021-12-21 18:18:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:44,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:44,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:44,622 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-21 18:18:44,636 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-21 18:18:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:44,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:18:44,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:44,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:18:44,785 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:18:44,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 18:18:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:44,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:44,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821490022] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:44,906 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:44,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-21 18:18:44,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773401076] [2021-12-21 18:18:44,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:44,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:18:44,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:44,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:18:44,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:18:44,907 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-21 18:18:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:44,932 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2021-12-21 18:18:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:18:44,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 15 [2021-12-21 18:18:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:44,933 INFO L225 Difference]: With dead ends: 129 [2021-12-21 18:18:44,933 INFO L226 Difference]: Without dead ends: 129 [2021-12-21 18:18:44,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:18:44,934 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:44,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 278 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 69 Unchecked, 0.0s Time] [2021-12-21 18:18:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-21 18:18:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-21 18:18:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2021-12-21 18:18:44,936 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 15 [2021-12-21 18:18:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:44,937 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2021-12-21 18:18:44,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-21 18:18:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2021-12-21 18:18:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:18:44,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:44,937 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:44,956 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-21 18:18:45,147 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-21 18:18:45,148 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2021-12-21 18:18:45,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:45,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090245704] [2021-12-21 18:18:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:45,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:45,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:45,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090245704] [2021-12-21 18:18:45,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090245704] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:45,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341498519] [2021-12-21 18:18:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:45,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:45,216 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-21 18:18:45,217 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-21 18:18:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:45,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 18:18:45,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:45,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:18:45,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:18:45,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:45,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:18:45,348 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:18:45,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:18:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:45,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:45,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341498519] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:45,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:45,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2021-12-21 18:18:45,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144665735] [2021-12-21 18:18:45,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:45,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:18:45,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:18:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:18:45,545 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:45,715 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-12-21 18:18:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:18:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 18:18:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:45,716 INFO L225 Difference]: With dead ends: 127 [2021-12-21 18:18:45,716 INFO L226 Difference]: Without dead ends: 127 [2021-12-21 18:18:45,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2021-12-21 18:18:45,717 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 496 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:45,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 344 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2021-12-21 18:18:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-21 18:18:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-21 18:18:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-12-21 18:18:45,719 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2021-12-21 18:18:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:45,719 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-12-21 18:18:45,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-12-21 18:18:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:18:45,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:45,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:45,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:18:45,929 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-21 18:18:45,929 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2021-12-21 18:18:45,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:45,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754786008] [2021-12-21 18:18:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:45,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:18:45,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:45,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754786008] [2021-12-21 18:18:45,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754786008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:45,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:45,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:18:45,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672637769] [2021-12-21 18:18:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:45,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:18:45,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:18:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:18:45,980 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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-21 18:18:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:46,082 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2021-12-21 18:18:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:18:46,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 22 [2021-12-21 18:18:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:46,083 INFO L225 Difference]: With dead ends: 124 [2021-12-21 18:18:46,083 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 18:18:46,083 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-21 18:18:46,083 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 107 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:46,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 325 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 18:18:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-21 18:18:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 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-21 18:18:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2021-12-21 18:18:46,085 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2021-12-21 18:18:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:46,086 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2021-12-21 18:18:46,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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-21 18:18:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2021-12-21 18:18:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:18:46,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:46,086 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:46,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 18:18:46,086 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2021-12-21 18:18:46,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:46,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289054666] [2021-12-21 18:18:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:46,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:18:46,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:46,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289054666] [2021-12-21 18:18:46,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289054666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:46,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:46,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:18:46,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350471097] [2021-12-21 18:18:46,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:46,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:18:46,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:46,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:18:46,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:18:46,137 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-21 18:18:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:46,218 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2021-12-21 18:18:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:18:46,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-12-21 18:18:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:46,219 INFO L225 Difference]: With dead ends: 117 [2021-12-21 18:18:46,219 INFO L226 Difference]: Without dead ends: 117 [2021-12-21 18:18:46,219 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-21 18:18:46,219 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:46,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 95 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-21 18:18:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-12-21 18:18:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2021-12-21 18:18:46,221 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2021-12-21 18:18:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:46,222 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2021-12-21 18:18:46,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-21 18:18:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2021-12-21 18:18:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:18:46,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:46,222 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:46,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 18:18:46,222 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2021-12-21 18:18:46,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:46,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842906182] [2021-12-21 18:18:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:46,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:18:46,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:46,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842906182] [2021-12-21 18:18:46,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842906182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:46,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:46,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:18:46,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066434777] [2021-12-21 18:18:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:46,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:18:46,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:46,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:18:46,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:18:46,271 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-21 18:18:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:46,338 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2021-12-21 18:18:46,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:18:46,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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 28 [2021-12-21 18:18:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:46,339 INFO L225 Difference]: With dead ends: 112 [2021-12-21 18:18:46,339 INFO L226 Difference]: Without dead ends: 112 [2021-12-21 18:18:46,339 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-21 18:18:46,340 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 386 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:46,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-21 18:18:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-12-21 18:18:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 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-21 18:18:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2021-12-21 18:18:46,360 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2021-12-21 18:18:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:46,360 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2021-12-21 18:18:46,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-21 18:18:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2021-12-21 18:18:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:18:46,361 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:46,361 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:46,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 18:18:46,361 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:46,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:46,362 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2021-12-21 18:18:46,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:46,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106419511] [2021-12-21 18:18:46,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:46,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:18:46,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:46,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106419511] [2021-12-21 18:18:46,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106419511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:46,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:46,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:18:46,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599526751] [2021-12-21 18:18:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:46,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:18:46,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:46,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:18:46,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:18:46,477 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-21 18:18:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:46,632 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2021-12-21 18:18:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:18:46,632 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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 28 [2021-12-21 18:18:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:46,633 INFO L225 Difference]: With dead ends: 107 [2021-12-21 18:18:46,633 INFO L226 Difference]: Without dead ends: 107 [2021-12-21 18:18:46,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:18:46,634 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 548 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:46,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 162 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-21 18:18:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-21 18:18:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 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-21 18:18:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2021-12-21 18:18:46,636 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2021-12-21 18:18:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:46,636 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2021-12-21 18:18:46,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-21 18:18:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2021-12-21 18:18:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:18:46,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:46,640 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:46,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 18:18:46,641 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:46,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2021-12-21 18:18:46,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:46,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873212156] [2021-12-21 18:18:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:46,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:46,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873212156] [2021-12-21 18:18:46,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873212156] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:46,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597769405] [2021-12-21 18:18:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:46,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:46,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:46,812 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-21 18:18:46,841 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-21 18:18:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:46,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-21 18:18:46,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:46,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:18:47,019 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:18:47,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:18:47,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:18:47,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 18:18:47,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 18:18:47,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:47,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:18:47,287 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:47,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-21 18:18:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:47,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:47,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2021-12-21 18:18:47,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-21 18:18:47,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-21 18:18:47,346 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:47,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-21 18:18:47,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-21 18:18:47,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2021-12-21 18:18:47,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-21 18:18:47,556 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:18:47,557 INFO L387 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 25 treesize of output 24 [2021-12-21 18:18:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 18:18:47,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597769405] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:47,568 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:47,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2021-12-21 18:18:47,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629993591] [2021-12-21 18:18:47,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:47,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-21 18:18:47,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-21 18:18:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=952, Unknown=3, NotChecked=192, Total=1260 [2021-12-21 18:18:47,569 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:48,284 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2021-12-21 18:18:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:18:48,285 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-21 18:18:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:48,285 INFO L225 Difference]: With dead ends: 106 [2021-12-21 18:18:48,286 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 18:18:48,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1896, Unknown=3, NotChecked=282, Total=2550 [2021-12-21 18:18:48,287 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 775 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:48,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 662 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 715 Invalid, 0 Unknown, 487 Unchecked, 0.3s Time] [2021-12-21 18:18:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 18:18:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2021-12-21 18:18:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2021-12-21 18:18:48,289 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2021-12-21 18:18:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:48,289 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2021-12-21 18:18:48,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2021-12-21 18:18:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:18:48,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:48,289 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:48,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 18:18:48,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-21 18:18:48,491 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2021-12-21 18:18:48,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:48,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67860786] [2021-12-21 18:18:48,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:48,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:18:48,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:48,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67860786] [2021-12-21 18:18:48,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67860786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:48,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:48,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:18:48,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365042677] [2021-12-21 18:18:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:48,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:18:48,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:18:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:18:48,644 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:48,848 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-21 18:18:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:18:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 18:18:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:48,849 INFO L225 Difference]: With dead ends: 97 [2021-12-21 18:18:48,849 INFO L226 Difference]: Without dead ends: 97 [2021-12-21 18:18:48,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:18:48,850 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 572 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:48,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 75 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-21 18:18:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-12-21 18:18:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 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-21 18:18:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2021-12-21 18:18:48,852 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2021-12-21 18:18:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:48,852 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2021-12-21 18:18:48,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2021-12-21 18:18:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:18:48,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:48,852 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:48,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 18:18:48,852 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2021-12-21 18:18:48,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413370338] [2021-12-21 18:18:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:48,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:49,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:49,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413370338] [2021-12-21 18:18:49,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413370338] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:49,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088479489] [2021-12-21 18:18:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:49,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:49,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:49,036 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-21 18:18:49,037 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-21 18:18:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:49,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-21 18:18:49,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:49,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:18:49,184 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:18:49,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:18:49,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:18:49,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 18:18:49,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2021-12-21 18:18:49,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:49,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2021-12-21 18:18:49,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2021-12-21 18:18:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:49,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:49,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-21 18:18:49,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-21 18:18:49,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-21 18:18:49,568 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:49,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-21 18:18:49,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2021-12-21 18:18:49,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2021-12-21 18:18:49,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-12-21 18:18:49,791 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:18:49,791 INFO L387 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 25 treesize of output 24 [2021-12-21 18:18:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 18:18:49,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088479489] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:49,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:49,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2021-12-21 18:18:49,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636001893] [2021-12-21 18:18:49,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:49,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-21 18:18:49,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:49,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-21 18:18:49,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=581, Unknown=3, NotChecked=150, Total=812 [2021-12-21 18:18:49,836 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:50,545 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2021-12-21 18:18:50,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 18:18:50,546 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 18:18:50,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:50,547 INFO L225 Difference]: With dead ends: 177 [2021-12-21 18:18:50,547 INFO L226 Difference]: Without dead ends: 177 [2021-12-21 18:18:50,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=983, Unknown=3, NotChecked=198, Total=1332 [2021-12-21 18:18:50,548 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 491 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 547 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:50,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 710 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 821 Invalid, 0 Unknown, 547 Unchecked, 0.4s Time] [2021-12-21 18:18:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-21 18:18:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 136. [2021-12-21 18:18:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 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-21 18:18:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2021-12-21 18:18:50,550 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2021-12-21 18:18:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:50,550 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2021-12-21 18:18:50,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2021-12-21 18:18:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:18:50,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:50,551 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:50,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-21 18:18:50,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 18:18:50,752 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:50,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2021-12-21 18:18:50,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:50,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098014231] [2021-12-21 18:18:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:50,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:18:50,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:50,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098014231] [2021-12-21 18:18:50,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098014231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:50,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:50,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:18:50,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176932593] [2021-12-21 18:18:50,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:50,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:18:50,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:50,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:18:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:18:50,878 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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-21 18:18:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:51,082 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2021-12-21 18:18:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:18:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-12-21 18:18:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:51,083 INFO L225 Difference]: With dead ends: 135 [2021-12-21 18:18:51,083 INFO L226 Difference]: Without dead ends: 135 [2021-12-21 18:18:51,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:18:51,083 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 233 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:51,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 286 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-21 18:18:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-12-21 18:18:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 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-21 18:18:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2021-12-21 18:18:51,086 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 30 [2021-12-21 18:18:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:51,086 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2021-12-21 18:18:51,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 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-21 18:18:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2021-12-21 18:18:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:18:51,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:51,087 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:51,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 18:18:51,087 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2021-12-21 18:18:51,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:51,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049668682] [2021-12-21 18:18:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:51,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:51,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:51,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049668682] [2021-12-21 18:18:51,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049668682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:51,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419052067] [2021-12-21 18:18:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:51,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:51,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:51,266 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:18:51,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 18:18:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:51,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-21 18:18:51,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:51,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:18:51,376 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:18:51,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:18:51,406 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:18:51,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:18:51,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:18:51,439 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:18:51,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:18:51,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-21 18:18:51,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:51,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:18:51,643 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:51,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2021-12-21 18:18:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:51,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:51,766 INFO L353 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2021-12-21 18:18:51,767 INFO L387 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 28 treesize of output 38 [2021-12-21 18:18:51,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_709) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) is different from false [2021-12-21 18:18:51,779 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:51,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2021-12-21 18:18:51,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 215 [2021-12-21 18:18:51,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 187 [2021-12-21 18:18:51,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 171 [2021-12-21 18:18:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-21 18:18:51,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419052067] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:51,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:51,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 28 [2021-12-21 18:18:51,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985848486] [2021-12-21 18:18:51,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:51,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-21 18:18:51,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-21 18:18:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=674, Unknown=1, NotChecked=52, Total=812 [2021-12-21 18:18:51,981 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 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-21 18:18:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:52,632 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2021-12-21 18:18:52,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 18:18:52,632 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-21 18:18:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:52,633 INFO L225 Difference]: With dead ends: 134 [2021-12-21 18:18:52,633 INFO L226 Difference]: Without dead ends: 134 [2021-12-21 18:18:52,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=1249, Unknown=1, NotChecked=76, Total=1640 [2021-12-21 18:18:52,634 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 189 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:52,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 901 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 697 Invalid, 0 Unknown, 152 Unchecked, 0.3s Time] [2021-12-21 18:18:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-21 18:18:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-12-21 18:18:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 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-21 18:18:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-12-21 18:18:52,636 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 30 [2021-12-21 18:18:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:52,636 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-12-21 18:18:52,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 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-21 18:18:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2021-12-21 18:18:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-21 18:18:52,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:52,637 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:52,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 18:18:52,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:52,837 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2021-12-21 18:18:52,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:52,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621386675] [2021-12-21 18:18:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:52,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:53,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:53,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621386675] [2021-12-21 18:18:53,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621386675] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:53,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065575744] [2021-12-21 18:18:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:53,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:53,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:53,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:18:53,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 18:18:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:53,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-21 18:18:53,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:53,157 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:18:53,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:18:53,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:18:53,267 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:53,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-21 18:18:53,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:18:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:53,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:53,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-21 18:18:53,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-21 18:18:53,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-21 18:18:53,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:53,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 18:18:53,683 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:18:53,684 INFO L387 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 13 treesize of output 12 [2021-12-21 18:18:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:53,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065575744] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:53,695 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:53,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2021-12-21 18:18:53,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134280868] [2021-12-21 18:18:53,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:53,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-21 18:18:53,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:53,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-21 18:18:53,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2021-12-21 18:18:53,696 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 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-21 18:18:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:54,241 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2021-12-21 18:18:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:18:54,242 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 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-21 18:18:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:54,242 INFO L225 Difference]: With dead ends: 133 [2021-12-21 18:18:54,242 INFO L226 Difference]: Without dead ends: 133 [2021-12-21 18:18:54,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=0, NotChecked=0, Total=1640 [2021-12-21 18:18:54,243 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 424 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:54,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 577 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 729 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2021-12-21 18:18:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-21 18:18:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-12-21 18:18:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 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-21 18:18:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2021-12-21 18:18:54,245 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 33 [2021-12-21 18:18:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:54,246 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2021-12-21 18:18:54,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 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-21 18:18:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2021-12-21 18:18:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-21 18:18:54,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:54,246 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:54,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 18:18:54,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:54,459 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:18:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2021-12-21 18:18:54,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:54,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941198893] [2021-12-21 18:18:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:54,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:54,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:54,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941198893] [2021-12-21 18:18:54,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941198893] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:54,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584570263] [2021-12-21 18:18:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:54,655 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:54,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:54,655 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:18:54,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 18:18:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:54,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-21 18:18:54,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:54,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:18:54,768 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:18:54,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:18:54,824 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:18:54,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:18:54,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:18:54,855 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:18:54,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:18:54,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-21 18:18:54,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:54,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:18:55,001 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:55,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-12-21 18:18:55,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:18:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:55,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:55,319 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0)) 1)) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2021-12-21 18:18:55,376 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) is different from false [2021-12-21 18:18:55,390 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:55,390 INFO L387 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 47 treesize of output 51 [2021-12-21 18:18:55,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_879 (Array Int Int)) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_prenex_3) 0)))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) is different from false [2021-12-21 18:18:55,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:55,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2021-12-21 18:18:55,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 235 [2021-12-21 18:18:55,452 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:55,452 INFO L387 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 273 treesize of output 273 [2021-12-21 18:18:55,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 282 [2021-12-21 18:18:55,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 302 [2021-12-21 18:18:55,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 312 [2021-12-21 18:18:55,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 356 [2021-12-21 18:18:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 18:18:55,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584570263] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:55,609 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:55,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2021-12-21 18:18:55,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187789058] [2021-12-21 18:18:55,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:55,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 18:18:55,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:55,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 18:18:55,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=3, NotChecked=174, Total=1056 [2021-12-21 18:18:55,611 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:57,706 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= .cse1 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_879 (Array Int Int)) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_prenex_3) 0)))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))))) is different from false [2021-12-21 18:18:58,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-21 18:19:10,770 WARN L227 SmtUtils]: Spent 12.48s on a formula simplification. DAG size of input: 63 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-21 18:19:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:11,156 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2021-12-21 18:19:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 18:19:11,157 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-21 18:19:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:11,157 INFO L225 Difference]: With dead ends: 132 [2021-12-21 18:19:11,157 INFO L226 Difference]: Without dead ends: 132 [2021-12-21 18:19:11,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=222, Invalid=1433, Unknown=5, NotChecked=410, Total=2070 [2021-12-21 18:19:11,158 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 179 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:11,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 803 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 666 Invalid, 0 Unknown, 341 Unchecked, 0.3s Time] [2021-12-21 18:19:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-21 18:19:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-12-21 18:19:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 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-21 18:19:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2021-12-21 18:19:11,161 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 33 [2021-12-21 18:19:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:11,161 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2021-12-21 18:19:11,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2021-12-21 18:19:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:19:11,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:11,162 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:11,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-21 18:19:11,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-21 18:19:11,381 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:19:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2021-12-21 18:19:11,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:11,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133163242] [2021-12-21 18:19:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:11,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:11,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:11,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133163242] [2021-12-21 18:19:11,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133163242] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:11,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191444777] [2021-12-21 18:19:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:11,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:11,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:19:11,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 18:19:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:11,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-21 18:19:11,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:11,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:19:11,844 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:19:11,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 18:19:11,936 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-21 18:19:11,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:19:11,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:19:12,006 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:12,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-21 18:19:12,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-21 18:19:12,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:12,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2021-12-21 18:19:12,254 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:12,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2021-12-21 18:19:12,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:19:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:12,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:12,475 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_968 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-21 18:19:12,495 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) (forall ((v_ArrVal_968 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-12-21 18:19:12,504 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:12,504 INFO L387 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 47 treesize of output 51 [2021-12-21 18:19:12,520 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_968 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_967) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-12-21 18:19:12,530 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:12,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:12,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2021-12-21 18:19:12,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:12,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2021-12-21 18:19:12,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 147 [2021-12-21 18:19:12,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-21 18:19:12,557 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 18:19:12,557 INFO L387 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 1 case distinctions, treesize of input 26 treesize of output 1 [2021-12-21 18:19:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 18:19:12,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191444777] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:12,865 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:12,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 50 [2021-12-21 18:19:12,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999927272] [2021-12-21 18:19:12,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:12,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-21 18:19:12,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:12,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-21 18:19:12,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2070, Unknown=3, NotChecked=282, Total=2550 [2021-12-21 18:19:12,867 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 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-21 18:19:13,762 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| Int)) (or (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28|) 0)))) (forall ((v_ArrVal_968 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-12-21 18:19:13,764 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| Int)) (or (and (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_28|) 0)))) (forall ((v_ArrVal_968 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-21 18:19:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:14,454 INFO L93 Difference]: Finished difference Result 251 states and 272 transitions. [2021-12-21 18:19:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-21 18:19:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 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 34 [2021-12-21 18:19:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:14,457 INFO L225 Difference]: With dead ends: 251 [2021-12-21 18:19:14,457 INFO L226 Difference]: Without dead ends: 251 [2021-12-21 18:19:14,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=669, Invalid=5826, Unknown=5, NotChecked=810, Total=7310 [2021-12-21 18:19:14,459 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 427 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:14,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 1037 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1106 Invalid, 0 Unknown, 650 Unchecked, 0.4s Time] [2021-12-21 18:19:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-21 18:19:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 164. [2021-12-21 18:19:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 163 states have internal predecessors, (182), 0 states have call successors, (0), 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-21 18:19:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 182 transitions. [2021-12-21 18:19:14,462 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 182 transitions. Word has length 34 [2021-12-21 18:19:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:14,462 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 182 transitions. [2021-12-21 18:19:14,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 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-21 18:19:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2021-12-21 18:19:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:19:14,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:14,463 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:14,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:14,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:14,680 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:19:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2021-12-21 18:19:14,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:14,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687043342] [2021-12-21 18:19:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:14,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:14,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687043342] [2021-12-21 18:19:14,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687043342] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254223837] [2021-12-21 18:19:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:14,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:14,849 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:19:14,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 18:19:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:14,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-21 18:19:14,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:14,988 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:19:14,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:19:15,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:19:15,078 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:15,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-21 18:19:15,213 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:19:15,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-21 18:19:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:15,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:15,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-12-21 18:19:15,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-21 18:19:15,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-21 18:19:15,475 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:19:15,476 INFO L387 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 13 treesize of output 12 [2021-12-21 18:19:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:15,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254223837] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:15,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:15,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 30 [2021-12-21 18:19:15,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110791709] [2021-12-21 18:19:15,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:15,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-21 18:19:15,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:15,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-21 18:19:15,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2021-12-21 18:19:15,487 INFO L87 Difference]: Start difference. First operand 164 states and 182 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:15,860 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2021-12-21 18:19:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:19:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-21 18:19:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:15,864 INFO L225 Difference]: With dead ends: 163 [2021-12-21 18:19:15,864 INFO L226 Difference]: Without dead ends: 163 [2021-12-21 18:19:15,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2021-12-21 18:19:15,868 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 607 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:15,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 456 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 419 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2021-12-21 18:19:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-21 18:19:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-21 18:19:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 148 states have (on average 1.2162162162162162) internal successors, (180), 162 states have internal predecessors, (180), 0 states have call successors, (0), 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-21 18:19:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2021-12-21 18:19:15,875 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 34 [2021-12-21 18:19:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:15,875 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2021-12-21 18:19:15,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2021-12-21 18:19:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:19:15,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:15,876 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:15,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:16,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-21 18:19:16,081 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:19:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2021-12-21 18:19:16,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:16,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264046696] [2021-12-21 18:19:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:16,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:16,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:16,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264046696] [2021-12-21 18:19:16,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264046696] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:16,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321092907] [2021-12-21 18:19:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:16,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:16,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:16,354 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:19:16,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 18:19:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:16,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-21 18:19:16,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:16,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:19:16,480 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:19:16,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 18:19:16,539 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-21 18:19:16,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:19:16,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:19:16,626 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:16,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:16,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-21 18:19:16,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:16,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-21 18:19:16,875 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:16,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2021-12-21 18:19:16,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:19:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:16,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:17,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 18:19:17,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-12-21 18:19:17,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-21 18:19:17,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-21 18:19:17,090 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:17,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:17,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-21 18:19:17,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2021-12-21 18:19:17,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-21 18:19:17,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-21 18:19:17,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-21 18:19:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 18:19:17,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321092907] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:17,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:17,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 47 [2021-12-21 18:19:17,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701467579] [2021-12-21 18:19:17,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:17,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-21 18:19:17,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-21 18:19:17,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1817, Unknown=3, NotChecked=264, Total=2256 [2021-12-21 18:19:17,406 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 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-21 18:19:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:18,477 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2021-12-21 18:19:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-21 18:19:18,478 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 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 34 [2021-12-21 18:19:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:18,478 INFO L225 Difference]: With dead ends: 160 [2021-12-21 18:19:18,478 INFO L226 Difference]: Without dead ends: 160 [2021-12-21 18:19:18,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=593, Invalid=3198, Unknown=3, NotChecked=366, Total=4160 [2021-12-21 18:19:18,479 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 718 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:18,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 543 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 780 Invalid, 0 Unknown, 358 Unchecked, 0.3s Time] [2021-12-21 18:19:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-21 18:19:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-21 18:19:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.195945945945946) internal successors, (177), 159 states have internal predecessors, (177), 0 states have call successors, (0), 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-21 18:19:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2021-12-21 18:19:18,482 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 34 [2021-12-21 18:19:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:18,482 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2021-12-21 18:19:18,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 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-21 18:19:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2021-12-21 18:19:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:19:18,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:18,483 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:18,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:18,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-21 18:19:18,684 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:19:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2021-12-21 18:19:18,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:18,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388411285] [2021-12-21 18:19:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:18,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:18,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:18,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388411285] [2021-12-21 18:19:18,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388411285] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:18,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663211841] [2021-12-21 18:19:18,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:18,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:18,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:18,846 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:19:18,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 18:19:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:18,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-21 18:19:18,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:18,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:19:18,979 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:18,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:19:19,009 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:19:19,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:19:19,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:19:19,064 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:19,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-21 18:19:19,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-21 18:19:19,112 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-21 18:19:19,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-12-21 18:19:19,185 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:19,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-21 18:19:19,278 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:19:19,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-21 18:19:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:19,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:19,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 18:19:19,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2021-12-21 18:19:19,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2021-12-21 18:19:19,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2021-12-21 18:19:19,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-21 18:19:19,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:19,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:19,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-21 18:19:19,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2021-12-21 18:19:19,775 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:19,775 INFO L387 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 116 treesize of output 120 [2021-12-21 18:19:19,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 118 [2021-12-21 18:19:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 18:19:19,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663211841] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:19,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:19,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 37 [2021-12-21 18:19:19,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100339729] [2021-12-21 18:19:19,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:19,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-21 18:19:19,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-21 18:19:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1018, Unknown=4, NotChecked=268, Total=1406 [2021-12-21 18:19:19,897 INFO L87 Difference]: Start difference. First operand 160 states and 177 transitions. Second operand has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 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-21 18:19:20,317 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-21 18:19:20,650 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-21 18:19:20,987 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2021-12-21 18:19:21,333 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-21 18:19:21,662 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2021-12-21 18:19:21,945 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2021-12-21 18:19:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:22,382 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2021-12-21 18:19:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 18:19:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 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 34 [2021-12-21 18:19:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:22,383 INFO L225 Difference]: With dead ends: 191 [2021-12-21 18:19:22,383 INFO L226 Difference]: Without dead ends: 191 [2021-12-21 18:19:22,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=239, Invalid=1683, Unknown=10, NotChecked=930, Total=2862 [2021-12-21 18:19:22,384 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 295 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:22,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 1250 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 924 Invalid, 0 Unknown, 556 Unchecked, 0.3s Time] [2021-12-21 18:19:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-21 18:19:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 165. [2021-12-21 18:19:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 153 states have (on average 1.196078431372549) internal successors, (183), 164 states have internal predecessors, (183), 0 states have call successors, (0), 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-21 18:19:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 183 transitions. [2021-12-21 18:19:22,387 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 183 transitions. Word has length 34 [2021-12-21 18:19:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:22,387 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 183 transitions. [2021-12-21 18:19:22,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 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-21 18:19:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2021-12-21 18:19:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:19:22,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:22,388 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:22,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:22,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-21 18:19:22,603 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:19:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1035188976, now seen corresponding path program 2 times [2021-12-21 18:19:22,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321934893] [2021-12-21 18:19:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:22,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:22,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321934893] [2021-12-21 18:19:22,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321934893] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659771105] [2021-12-21 18:19:22,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:19:22,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:22,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:22,636 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:19:22,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-21 18:19:22,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 18:19:22,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:19:22,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:19:22,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:22,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:22,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659771105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:22,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:19:22,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-21 18:19:22,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719736810] [2021-12-21 18:19:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:22,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:19:22,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:22,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:19:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:22,784 INFO L87 Difference]: Start difference. First operand 165 states and 183 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-21 18:19:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:22,789 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-12-21 18:19:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:19:22,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-12-21 18:19:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:22,790 INFO L225 Difference]: With dead ends: 82 [2021-12-21 18:19:22,790 INFO L226 Difference]: Without dead ends: 82 [2021-12-21 18:19:22,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:22,791 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 210 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:22,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 92 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:19:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-21 18:19:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-21 18:19:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 18:19:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2021-12-21 18:19:22,793 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 34 [2021-12-21 18:19:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:22,793 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2021-12-21 18:19:22,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-21 18:19:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2021-12-21 18:19:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:19:22,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:22,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:22,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:23,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-21 18:19:23,012 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:19:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2021-12-21 18:19:23,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:23,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275360675] [2021-12-21 18:19:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:23,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:23,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:23,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275360675] [2021-12-21 18:19:23,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275360675] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:23,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887395798] [2021-12-21 18:19:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:23,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:23,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:23,374 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:19:23,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-21 18:19:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:23,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-21 18:19:23,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:23,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:19:23,515 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:19:23,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 18:19:23,591 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-21 18:19:23,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:19:23,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:19:23,669 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:23,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-21 18:19:23,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-21 18:19:23,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2021-12-21 18:19:23,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:23,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:23,965 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:23,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 55 [2021-12-21 18:19:24,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-21 18:19:24,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-21 18:19:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:24,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:25,555 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) .cse0)) (= (select |c_#valid| .cse0) 1)))))) is different from false [2021-12-21 18:19:26,356 INFO L353 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2021-12-21 18:19:26,356 INFO L387 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 89 treesize of output 114 [2021-12-21 18:19:26,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (and (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (let ((.cse0 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1410) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)))) (forall ((v_prenex_11 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))))))) is different from false [2021-12-21 18:19:26,470 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:26,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 102 [2021-12-21 18:19:26,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 427 treesize of output 413 [2021-12-21 18:19:26,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:26,487 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:26,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 512 treesize of output 508 [2021-12-21 18:19:26,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:26,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 551 treesize of output 527 [2021-12-21 18:19:26,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 525 treesize of output 517 [2021-12-21 18:19:26,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 519 [2021-12-21 18:19:26,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 538 treesize of output 534 [2021-12-21 18:19:26,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 586 treesize of output 578 [2021-12-21 18:19:26,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:26,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 631 treesize of output 619 [2021-12-21 18:19:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-21 18:19:27,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887395798] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:27,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:27,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 54 [2021-12-21 18:19:27,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40386645] [2021-12-21 18:19:27,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:27,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-21 18:19:27,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:27,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-21 18:19:27,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=3, NotChecked=206, Total=2970 [2021-12-21 18:19:27,067 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:27,714 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (and (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (let ((.cse1 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1410) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)))) (forall ((v_prenex_11 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (not (let ((.cse2 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-21 18:19:28,285 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse2 (select .cse3 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (not (= (select .cse3 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) .cse2)) (= (select |c_#valid| .cse2) 1)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-21 18:19:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:28,973 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2021-12-21 18:19:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:19:28,973 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-21 18:19:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:28,974 INFO L225 Difference]: With dead ends: 81 [2021-12-21 18:19:28,974 INFO L226 Difference]: Without dead ends: 81 [2021-12-21 18:19:28,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=348, Invalid=3823, Unknown=5, NotChecked=516, Total=4692 [2021-12-21 18:19:28,975 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 101 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:28,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 1070 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 879 Invalid, 0 Unknown, 466 Unchecked, 0.3s Time] [2021-12-21 18:19:28,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-21 18:19:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-21 18:19:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.103896103896104) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2021-12-21 18:19:28,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 36 [2021-12-21 18:19:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:28,981 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2021-12-21 18:19:28,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2021-12-21 18:19:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 18:19:28,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:28,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:28,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:29,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:29,182 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:19:29,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1472889600, now seen corresponding path program 1 times [2021-12-21 18:19:29,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:29,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572295345] [2021-12-21 18:19:29,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:29,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:29,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:29,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572295345] [2021-12-21 18:19:29,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572295345] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:29,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946078468] [2021-12-21 18:19:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:29,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:29,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:29,494 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:19:29,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 18:19:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:29,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-21 18:19:29,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:29,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:19:29,618 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:29,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:19:29,672 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:19:29,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:19:29,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:19:29,728 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:29,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-21 18:19:29,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-21 18:19:29,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-12-21 18:19:29,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:29,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:29,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:29,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2021-12-21 18:19:30,101 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:19:30,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-21 18:19:30,206 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:19:30,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2021-12-21 18:19:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:30,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:30,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2021-12-21 18:19:30,548 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1502 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2021-12-21 18:19:30,558 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1502 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-21 18:19:30,573 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1501 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1501 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-21 18:19:30,578 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:30,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:30,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-21 18:19:30,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85 [2021-12-21 18:19:30,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2021-12-21 18:19:30,597 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:30,597 INFO L387 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 127 treesize of output 131 [2021-12-21 18:19:30,634 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:30,635 INFO L387 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 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:30,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:30,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 43 treesize of output 39 [2021-12-21 18:19:30,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2021-12-21 18:19:30,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:30,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2021-12-21 18:19:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 18:19:30,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946078468] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:30,762 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:30,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 49 [2021-12-21 18:19:30,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565313724] [2021-12-21 18:19:30,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:30,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-21 18:19:30,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-21 18:19:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1969, Unknown=3, NotChecked=276, Total=2450 [2021-12-21 18:19:30,764 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 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-21 18:19:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:31,632 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-12-21 18:19:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:19:31,632 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 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-21 18:19:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:31,633 INFO L225 Difference]: With dead ends: 79 [2021-12-21 18:19:31,633 INFO L226 Difference]: Without dead ends: 79 [2021-12-21 18:19:31,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=486, Invalid=3555, Unknown=3, NotChecked=378, Total=4422 [2021-12-21 18:19:31,634 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 507 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:31,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 572 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 639 Invalid, 0 Unknown, 412 Unchecked, 0.2s Time] [2021-12-21 18:19:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-21 18:19:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-12-21 18:19:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 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-21 18:19:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2021-12-21 18:19:31,636 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2021-12-21 18:19:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:31,636 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2021-12-21 18:19:31,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 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-21 18:19:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2021-12-21 18:19:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 18:19:31,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:31,636 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:31,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:31,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-21 18:19:31,853 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-21 18:19:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1427207630, now seen corresponding path program 1 times [2021-12-21 18:19:31,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:31,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437048306] [2021-12-21 18:19:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:31,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:32,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:32,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437048306] [2021-12-21 18:19:32,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437048306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:32,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927434814] [2021-12-21 18:19:32,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:32,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:32,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:32,239 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:19:32,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-21 18:19:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:32,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-21 18:19:32,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:32,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:19:32,407 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:19:32,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 18:19:32,489 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-21 18:19:32,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:19:32,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:19:32,556 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:32,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-21 18:19:32,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-21 18:19:32,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2021-12-21 18:19:32,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:32,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:32,799 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:32,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 50 [2021-12-21 18:19:33,309 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:19:33,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-21 18:19:33,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:19:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:33,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:36,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (forall ((v_ArrVal_1598 Int)) (= (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) v_ArrVal_1598) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2021-12-21 18:19:36,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (and (forall ((v_ArrVal_1595 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1595 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) v_ArrVal_1598) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2021-12-21 18:19:36,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (and (forall ((v_ArrVal_1598 Int) (v_ArrVal_1595 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) v_ArrVal_1598) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1)) (forall ((v_ArrVal_1595 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2021-12-21 18:19:36,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:36,109 INFO L387 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 124 treesize of output 128 [2021-12-21 18:19:36,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (and (forall ((v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1594 (Array Int Int)) (v_prenex_15 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_15) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1594 (Array Int Int)) (v_prenex_15 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_15) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2021-12-21 18:19:36,171 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:36,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 83 [2021-12-21 18:19:36,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 476 treesize of output 460 [2021-12-21 18:19:36,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:36,186 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:36,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 595 treesize of output 581 [2021-12-21 18:19:36,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:36,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 622 treesize of output 598 [2021-12-21 18:19:36,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:36,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 760 treesize of output 712 [2021-12-21 18:19:36,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 638 treesize of output 634 [2021-12-21 18:19:36,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 682 treesize of output 674 [2021-12-21 18:19:36,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 698 treesize of output 694 [2021-12-21 18:19:36,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 707 treesize of output 705 [2021-12-21 18:19:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 18:19:36,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927434814] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:36,758 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:36,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 21] total 57 [2021-12-21 18:19:36,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005628619] [2021-12-21 18:19:36,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:36,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-21 18:19:36,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:36,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-21 18:19:36,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2659, Unknown=4, NotChecked=428, Total=3306 [2021-12-21 18:19:36,760 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 58 states, 57 states have (on average 1.719298245614035) internal successors, (98), 58 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:51,415 WARN L227 SmtUtils]: Spent 14.48s on a formula simplification. DAG size of input: 68 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)