./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all.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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:50:03,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:50:03,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:50:03,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:50:03,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:50:03,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:50:03,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:50:03,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:50:03,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:50:03,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:50:03,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:50:03,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:50:03,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:50:03,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:50:03,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:50:03,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:50:03,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:50:03,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:50:03,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:50:03,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:50:03,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:50:03,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:50:03,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:50:03,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:50:03,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:50:03,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:50:03,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:50:03,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:50:03,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:50:03,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:50:03,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:50:03,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:50:03,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:50:03,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:50:03,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:50:03,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:50:03,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:50:03,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:50:03,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:50:03,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:50:03,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:50:03,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:50:03,863 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:50:03,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:50:03,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:50:03,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:50:03,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:50:03,864 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:50:03,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:50:03,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:50:03,865 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:50:03,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:50:03,866 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:50:03,866 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:50:03,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:50:03,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:50:03,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:50:03,867 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:50:03,867 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:50:03,867 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:50:03,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:50:03,867 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:50:03,868 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:50:03,868 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:50:03,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:50:03,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:50:03,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:50:03,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:50:03,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:50:03,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:50:03,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:50:03,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:50:03,869 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:50:03,870 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2021-12-14 19:50:04,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:50:04,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:50:04,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:50:04,076 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:50:04,076 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:50:04,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2021-12-14 19:50:04,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c677043a/e22a606b66d342e2ad04e377ff1f0293/FLAG8d1dc45f9 [2021-12-14 19:50:04,535 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:50:04,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2021-12-14 19:50:04,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c677043a/e22a606b66d342e2ad04e377ff1f0293/FLAG8d1dc45f9 [2021-12-14 19:50:04,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c677043a/e22a606b66d342e2ad04e377ff1f0293 [2021-12-14 19:50:04,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:50:04,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:50:04,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:50:04,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:50:04,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:50:04,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:50:04" (1/1) ... [2021-12-14 19:50:04,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb08684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:04, skipping insertion in model container [2021-12-14 19:50:04,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:50:04" (1/1) ... [2021-12-14 19:50:04,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:50:04,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:50:05,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2021-12-14 19:50:05,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:50:05,258 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:50:05,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2021-12-14 19:50:05,302 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:50:05,323 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:50:05,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05 WrapperNode [2021-12-14 19:50:05,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:50:05,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:50:05,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:50:05,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:50:05,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,375 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2021-12-14 19:50:05,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:50:05,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:50:05,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:50:05,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:50:05,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:50:05,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:50:05,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:50:05,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:50:05,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (1/1) ... [2021-12-14 19:50:05,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:50:05,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:05,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:50:05,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:50:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-14 19:50:05,484 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-14 19:50:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:50:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:50:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:50:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:50:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:50:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:50:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:50:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:50:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:50:05,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:50:05,597 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:50:05,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:50:05,628 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-14 19:50:05,801 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:50:05,807 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:50:05,808 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 19:50:05,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:50:05 BoogieIcfgContainer [2021-12-14 19:50:05,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:50:05,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:50:05,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:50:05,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:50:05,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:50:04" (1/3) ... [2021-12-14 19:50:05,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a78fc44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:50:05, skipping insertion in model container [2021-12-14 19:50:05,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:05" (2/3) ... [2021-12-14 19:50:05,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a78fc44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:50:05, skipping insertion in model container [2021-12-14 19:50:05,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:50:05" (3/3) ... [2021-12-14 19:50:05,815 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2021-12-14 19:50:05,821 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:50:05,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-12-14 19:50:05,856 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:50:05,863 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:50:05,863 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-12-14 19:50:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:50:05,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:05,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:50:05,882 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:05,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-12-14 19:50:05,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:05,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630913163] [2021-12-14 19:50:05,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:05,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:06,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:06,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630913163] [2021-12-14 19:50:06,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630913163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:06,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:06,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:50:06,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900597301] [2021-12-14 19:50:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:06,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:50:06,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:50:06,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:06,054 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:06,137 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2021-12-14 19:50:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:50:06,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-14 19:50:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:06,144 INFO L225 Difference]: With dead ends: 111 [2021-12-14 19:50:06,144 INFO L226 Difference]: Without dead ends: 104 [2021-12-14 19:50:06,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:06,147 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:06,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-14 19:50:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-14 19:50:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2021-12-14 19:50:06,168 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2021-12-14 19:50:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:06,169 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2021-12-14 19:50:06,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2021-12-14 19:50:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:50:06,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:06,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:50:06,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:50:06,170 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-12-14 19:50:06,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:06,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485906231] [2021-12-14 19:50:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:06,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:06,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:06,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485906231] [2021-12-14 19:50:06,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485906231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:06,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:06,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:50:06,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14543749] [2021-12-14 19:50:06,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:06,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:50:06,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:06,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:50:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:06,215 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:06,272 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-12-14 19:50:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:50:06,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-14 19:50:06,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:06,273 INFO L225 Difference]: With dead ends: 101 [2021-12-14 19:50:06,273 INFO L226 Difference]: Without dead ends: 101 [2021-12-14 19:50:06,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:06,274 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:06,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-14 19:50:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2021-12-14 19:50:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-12-14 19:50:06,293 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2021-12-14 19:50:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:06,295 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-12-14 19:50:06,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-12-14 19:50:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:50:06,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:06,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:06,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:50:06,297 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2021-12-14 19:50:06,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:06,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315304700] [2021-12-14 19:50:06,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:06,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:06,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:06,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315304700] [2021-12-14 19:50:06,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315304700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:06,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:06,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:50:06,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607689035] [2021-12-14 19:50:06,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:06,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:50:06,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:06,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:50:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:06,326 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:06,335 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-12-14 19:50:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:50:06,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-14 19:50:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:06,336 INFO L225 Difference]: With dead ends: 66 [2021-12-14 19:50:06,336 INFO L226 Difference]: Without dead ends: 66 [2021-12-14 19:50:06,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:06,337 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:06,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-14 19:50:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2021-12-14 19:50:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2021-12-14 19:50:06,341 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2021-12-14 19:50:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:06,341 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2021-12-14 19:50:06,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2021-12-14 19:50:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:50:06,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:06,342 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:06,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:50:06,343 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:06,343 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-12-14 19:50:06,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:06,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001565133] [2021-12-14 19:50:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:06,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:06,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:06,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:06,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001565133] [2021-12-14 19:50:06,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001565133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:06,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:06,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:50:06,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811353865] [2021-12-14 19:50:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:06,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:50:06,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:06,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:50:06,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:06,385 INFO L87 Difference]: Start difference. First operand 57 states and 63 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-14 19:50:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:06,395 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-14 19:50:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:50:06,396 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-14 19:50:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:06,396 INFO L225 Difference]: With dead ends: 63 [2021-12-14 19:50:06,396 INFO L226 Difference]: Without dead ends: 63 [2021-12-14 19:50:06,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:06,397 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 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-14 19:50:06,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-14 19:50:06,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-14 19:50:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 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-14 19:50:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-14 19:50:06,401 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2021-12-14 19:50:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:06,401 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-14 19:50:06,401 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-14 19:50:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-14 19:50:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:50:06,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:06,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:06,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:50:06,402 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:06,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2021-12-14 19:50:06,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:06,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377004425] [2021-12-14 19:50:06,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:06,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:06,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:06,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377004425] [2021-12-14 19:50:06,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377004425] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:06,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473517712] [2021-12-14 19:50:06,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:06,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:06,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:06,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:06,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:50:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:06,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:50:06,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:06,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:06,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473517712] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:06,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:06,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-14 19:50:06,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829551968] [2021-12-14 19:50:06,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:06,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:50:06,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:06,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:50:06,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:50:06,624 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:06,634 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-14 19:50:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:50:06,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-14 19:50:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:06,635 INFO L225 Difference]: With dead ends: 64 [2021-12-14 19:50:06,635 INFO L226 Difference]: Without dead ends: 64 [2021-12-14 19:50:06,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-14 19:50:06,645 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:06,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-14 19:50:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-14 19:50:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-12-14 19:50:06,653 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2021-12-14 19:50:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:06,653 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-12-14 19:50:06,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-12-14 19:50:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:50:06,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:06,656 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:06,681 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-14 19:50:06,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:06,868 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:06,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-12-14 19:50:06,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:06,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618347589] [2021-12-14 19:50:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:06,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:06,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:06,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618347589] [2021-12-14 19:50:06,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618347589] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:06,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173888077] [2021-12-14 19:50:06,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:06,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:06,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:06,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:06,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:50:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:07,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:50:07,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:07,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:07,134 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:50:07,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:50:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:07,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:07,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173888077] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:07,264 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:07,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-14 19:50:07,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178024852] [2021-12-14 19:50:07,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:07,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:07,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:07,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:07,266 INFO L87 Difference]: Start difference. First operand 64 states and 70 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-14 19:50:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:07,304 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2021-12-14 19:50:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:50:07,304 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 16 [2021-12-14 19:50:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:07,305 INFO L225 Difference]: With dead ends: 77 [2021-12-14 19:50:07,305 INFO L226 Difference]: Without dead ends: 77 [2021-12-14 19:50:07,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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-14 19:50:07,306 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:07,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2021-12-14 19:50:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-14 19:50:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-12-14 19:50:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-12-14 19:50:07,309 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2021-12-14 19:50:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:07,309 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-12-14 19:50:07,309 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-14 19:50:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-12-14 19:50:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:50:07,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:07,310 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:07,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:07,519 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,SelfDestructingSolverStorable5 [2021-12-14 19:50:07,520 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-12-14 19:50:07,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:07,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395379809] [2021-12-14 19:50:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:07,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:07,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:07,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395379809] [2021-12-14 19:50:07,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395379809] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:07,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728730382] [2021-12-14 19:50:07,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:07,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:07,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:07,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:07,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:50:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:07,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:50:07,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:07,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:07,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:07,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:50:07,780 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:07,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:07,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:07,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-12-14 19:50:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:08,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728730382] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:08,052 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:08,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-14 19:50:08,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077709945] [2021-12-14 19:50:08,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:08,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:50:08,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:08,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:50:08,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:08,053 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:08,138 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-12-14 19:50:08,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:50:08,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:50:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:08,140 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:50:08,140 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:50:08,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:50:08,141 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 339 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:08,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 58 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2021-12-14 19:50:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:50:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2021-12-14 19:50:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 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-14 19:50:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-14 19:50:08,144 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2021-12-14 19:50:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:08,144 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-14 19:50:08,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-14 19:50:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:50:08,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:08,145 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:08,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:08,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:08,359 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2021-12-14 19:50:08,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:08,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827163076] [2021-12-14 19:50:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:08,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:08,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:08,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827163076] [2021-12-14 19:50:08,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827163076] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:08,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059293103] [2021-12-14 19:50:08,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:50:08,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:08,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:08,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:08,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:50:08,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 19:50:08,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:50:08,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:50:08,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:08,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:50:08,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059293103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:08,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:50:08,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-14 19:50:08,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213299307] [2021-12-14 19:50:08,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:08,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:50:08,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:50:08,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:50:08,495 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:08,520 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2021-12-14 19:50:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:50:08,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-14 19:50:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:08,522 INFO L225 Difference]: With dead ends: 160 [2021-12-14 19:50:08,522 INFO L226 Difference]: Without dead ends: 160 [2021-12-14 19:50:08,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:08,523 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:08,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 212 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-14 19:50:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 64. [2021-12-14 19:50:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-12-14 19:50:08,534 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2021-12-14 19:50:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:08,534 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-12-14 19:50:08,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-12-14 19:50:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:50:08,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:08,535 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:08,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:08,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:08,743 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2021-12-14 19:50:08,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:08,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269006506] [2021-12-14 19:50:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:08,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:08,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:08,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269006506] [2021-12-14 19:50:08,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269006506] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:08,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084501902] [2021-12-14 19:50:08,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:08,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:08,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:08,796 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:08,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:50:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:08,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:50:08,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:08,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:08,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084501902] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:08,948 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:08,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-14 19:50:08,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918535602] [2021-12-14 19:50:08,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:08,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:50:08,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:50:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:50:08,949 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-14 19:50:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:08,974 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-14 19:50:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:50:08,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-14 19:50:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:08,974 INFO L225 Difference]: With dead ends: 64 [2021-12-14 19:50:08,974 INFO L226 Difference]: Without dead ends: 64 [2021-12-14 19:50:08,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:50:08,975 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:08,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-14 19:50:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-14 19:50:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-12-14 19:50:08,977 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 22 [2021-12-14 19:50:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:08,978 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-12-14 19:50:08,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-14 19:50:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-12-14 19:50:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:50:08,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:08,978 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:09,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:09,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:09,179 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2021-12-14 19:50:09,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:09,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139203535] [2021-12-14 19:50:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:09,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:50:09,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139203535] [2021-12-14 19:50:09,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139203535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:09,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:09,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:09,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030247533] [2021-12-14 19:50:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:09,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:09,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:09,242 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:09,346 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-12-14 19:50:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 19:50:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:09,347 INFO L225 Difference]: With dead ends: 114 [2021-12-14 19:50:09,347 INFO L226 Difference]: Without dead ends: 114 [2021-12-14 19:50:09,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:09,348 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:09,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-14 19:50:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 67. [2021-12-14 19:50:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2021-12-14 19:50:09,351 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 23 [2021-12-14 19:50:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:09,351 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-12-14 19:50:09,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2021-12-14 19:50:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:50:09,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:09,352 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:09,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:50:09,352 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:09,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2021-12-14 19:50:09,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:09,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242613795] [2021-12-14 19:50:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:09,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:09,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:09,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242613795] [2021-12-14 19:50:09,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242613795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:09,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:09,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:09,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937743562] [2021-12-14 19:50:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:09,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:09,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:09,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:09,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:09,443 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:09,540 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-14 19:50:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:09,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 19:50:09,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:09,541 INFO L225 Difference]: With dead ends: 102 [2021-12-14 19:50:09,541 INFO L226 Difference]: Without dead ends: 102 [2021-12-14 19:50:09,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:09,542 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:09,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-14 19:50:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2021-12-14 19:50:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-12-14 19:50:09,544 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 23 [2021-12-14 19:50:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:09,544 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-12-14 19:50:09,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-12-14 19:50:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:50:09,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:09,544 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:09,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:50:09,545 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2021-12-14 19:50:09,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:09,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253803788] [2021-12-14 19:50:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:09,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:09,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:09,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253803788] [2021-12-14 19:50:09,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253803788] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:09,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:09,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:50:09,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019317445] [2021-12-14 19:50:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:09,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:50:09,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:09,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:50:09,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:50:09,591 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:09,603 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-12-14 19:50:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:50:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-14 19:50:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:09,604 INFO L225 Difference]: With dead ends: 85 [2021-12-14 19:50:09,604 INFO L226 Difference]: Without dead ends: 85 [2021-12-14 19:50:09,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:50:09,605 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 85 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:09,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 105 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-14 19:50:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2021-12-14 19:50:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-12-14 19:50:09,607 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 25 [2021-12-14 19:50:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:09,607 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-12-14 19:50:09,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-12-14 19:50:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:50:09,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:09,608 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:09,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:50:09,608 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551635, now seen corresponding path program 1 times [2021-12-14 19:50:09,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:09,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653749343] [2021-12-14 19:50:09,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:09,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 19:50:09,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:09,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653749343] [2021-12-14 19:50:09,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653749343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:09,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:09,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:09,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628519731] [2021-12-14 19:50:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:09,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:09,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:09,656 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-14 19:50:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:09,748 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2021-12-14 19:50:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:09,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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 30 [2021-12-14 19:50:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:09,749 INFO L225 Difference]: With dead ends: 87 [2021-12-14 19:50:09,749 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 19:50:09,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:09,749 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 238 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:09,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 95 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 19:50:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2021-12-14 19:50:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-14 19:50:09,752 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 30 [2021-12-14 19:50:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:09,752 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-14 19:50:09,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-14 19:50:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-14 19:50:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:50:09,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:09,753 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:09,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:50:09,753 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2021-12-14 19:50:09,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:09,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463600233] [2021-12-14 19:50:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:09,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:50:09,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:09,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463600233] [2021-12-14 19:50:09,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463600233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:09,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:09,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:09,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565527758] [2021-12-14 19:50:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:09,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:09,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:09,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:09,814 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 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-14 19:50:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:09,913 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-12-14 19:50:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:09,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 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-14 19:50:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:09,914 INFO L225 Difference]: With dead ends: 94 [2021-12-14 19:50:09,914 INFO L226 Difference]: Without dead ends: 94 [2021-12-14 19:50:09,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:09,914 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 324 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:09,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 75 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-14 19:50:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2021-12-14 19:50:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2021-12-14 19:50:09,916 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 30 [2021-12-14 19:50:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:09,917 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2021-12-14 19:50:09,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 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-14 19:50:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2021-12-14 19:50:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:50:09,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:09,918 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:09,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:50:09,918 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2021-12-14 19:50:09,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:09,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840415867] [2021-12-14 19:50:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:09,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:09,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:09,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840415867] [2021-12-14 19:50:09,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840415867] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:09,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245767332] [2021-12-14 19:50:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:09,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:09,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:09,957 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:09,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:50:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:10,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:50:10,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:10,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:10,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245767332] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:10,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:10,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2021-12-14 19:50:10,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198476252] [2021-12-14 19:50:10,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:10,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:10,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:10,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:10,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:10,129 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:10,161 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2021-12-14 19:50:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:10,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 19:50:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:10,163 INFO L225 Difference]: With dead ends: 136 [2021-12-14 19:50:10,163 INFO L226 Difference]: Without dead ends: 136 [2021-12-14 19:50:10,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:50:10,165 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 167 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:10,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 184 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-14 19:50:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2021-12-14 19:50:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.375) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2021-12-14 19:50:10,167 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 31 [2021-12-14 19:50:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:10,168 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2021-12-14 19:50:10,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2021-12-14 19:50:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:50:10,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:10,171 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:10,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:10,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 19:50:10,390 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2021-12-14 19:50:10,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:10,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411837079] [2021-12-14 19:50:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:10,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:10,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:10,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411837079] [2021-12-14 19:50:10,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411837079] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:10,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689097662] [2021-12-14 19:50:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:10,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:10,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:10,553 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:10,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:50:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:10,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-14 19:50:10,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:10,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:10,680 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:10,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:10,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:50:10,729 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-14 19:50:10,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:50:10,752 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:10,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-14 19:50:10,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:10,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2021-12-14 19:50:10,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-14 19:50:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:10,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:16,312 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-14 19:50:16,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:50:16,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_845) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) is different from false [2021-12-14 19:50:16,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_843 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_843)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_845) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) is different from false [2021-12-14 19:50:16,341 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-14 19:50:16,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-14 19:50:16,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-14 19:50:16,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 19:50:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2021-12-14 19:50:16,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689097662] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:16,408 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:16,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 32 [2021-12-14 19:50:16,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661329645] [2021-12-14 19:50:16,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:16,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 19:50:16,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:16,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 19:50:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=844, Unknown=3, NotChecked=118, Total=1056 [2021-12-14 19:50:16,410 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:17,323 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2021-12-14 19:50:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 19:50:17,323 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 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 31 [2021-12-14 19:50:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:17,325 INFO L225 Difference]: With dead ends: 217 [2021-12-14 19:50:17,325 INFO L226 Difference]: Without dead ends: 217 [2021-12-14 19:50:17,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=330, Invalid=1931, Unknown=3, NotChecked=186, Total=2450 [2021-12-14 19:50:17,326 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 934 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:17,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 838 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 827 Invalid, 0 Unknown, 313 Unchecked, 0.4s Time] [2021-12-14 19:50:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-14 19:50:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 109. [2021-12-14 19:50:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-12-14 19:50:17,329 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 31 [2021-12-14 19:50:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:17,329 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-12-14 19:50:17,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-12-14 19:50:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:50:17,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:17,330 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:17,349 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-14 19:50:17,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:17,530 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2021-12-14 19:50:17,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:17,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588312912] [2021-12-14 19:50:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:17,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:17,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:17,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588312912] [2021-12-14 19:50:17,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588312912] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:17,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102688076] [2021-12-14 19:50:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:17,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:17,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:17,796 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-14 19:50:17,797 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-14 19:50:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:17,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-14 19:50:17,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:17,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:17,968 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:17,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:18,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:50:18,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:50:18,044 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-14 19:50:18,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:50:18,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:18,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:50:18,091 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:18,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-14 19:50:18,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-12-14 19:50:18,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:18,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2021-12-14 19:50:18,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:18,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2021-12-14 19:50:18,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-14 19:50:18,360 INFO L388 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 32 treesize of output 14 [2021-12-14 19:50:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:18,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:20,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0))))) (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-12-14 19:50:22,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (<= (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0)))))))) is different from false [2021-12-14 19:50:24,737 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0))))) (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-12-14 19:50:26,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0)))))))) is different from false [2021-12-14 19:50:26,805 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:26,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2021-12-14 19:50:26,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_964 Int) (v_ArrVal_961 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) is different from false [2021-12-14 19:50:26,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_959 Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_959)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_960 Int) (v_ArrVal_964 Int) (v_ArrVal_961 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_960)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_960 Int) (v_prenex_2 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_960)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))))) is different from false [2021-12-14 19:50:26,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:26,969 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:26,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 104 [2021-12-14 19:50:26,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 117 [2021-12-14 19:50:26,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:26,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:26,978 INFO L388 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 114 treesize of output 102 [2021-12-14 19:50:26,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 113 [2021-12-14 19:50:26,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:26,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:26,985 INFO L388 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 110 treesize of output 98 [2021-12-14 19:50:26,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:26,997 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:26,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 103 [2021-12-14 19:50:27,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 114 [2021-12-14 19:50:27,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:27,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:27,005 INFO L388 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 111 treesize of output 99 [2021-12-14 19:50:27,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:27,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2021-12-14 19:50:27,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:27,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-12-14 19:50:27,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:27,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2021-12-14 19:50:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-14 19:50:27,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102688076] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:27,206 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:27,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 39 [2021-12-14 19:50:27,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936436166] [2021-12-14 19:50:27,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:27,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-14 19:50:27,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-14 19:50:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1035, Unknown=6, NotChecked=414, Total=1560 [2021-12-14 19:50:27,208 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:29,455 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_964 Int) (v_ArrVal_961 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) is different from false [2021-12-14 19:50:30,015 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_prenex_2 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_prenex_2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_964 Int) (v_ArrVal_961 (Array Int Int))) (<= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (<= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) is different from false [2021-12-14 19:50:30,506 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse2 (select |c_#length| .cse1))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= 12 .cse2) (<= 0 .cse0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse3)))))))) (<= (+ .cse0 12) .cse2))))) is different from false [2021-12-14 19:50:30,958 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse2 (select .cse0 .cse5)) (.cse1 (select .cse4 .cse5))) (and (= (select |c_#length| (select .cse0 4)) 12) (<= (+ 12 .cse1) (select |c_#length| .cse2)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse3))))) (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2)) (<= 0 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2021-12-14 19:50:31,406 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse2 .cse5)) (.cse3 (select .cse0 .cse5))) (and (= (select .cse0 4) 0) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse1)) (= 12 (select |c_#length| (select .cse2 4))) (<= (+ .cse3 12) (select |c_#length| .cse1)) (<= 0 .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|) (and (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (<= (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse4)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse4))))))))))) is different from false [2021-12-14 19:50:31,865 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse3 .cse5)) (.cse4 (select .cse1 .cse5))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_18| Int)) (or (and (forall ((v_ArrVal_965 Int) (v_ArrVal_964 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_965) .cse0))))) (forall ((v_ArrVal_964 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_18| v_ArrVal_964) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_18|))) (= (select |c_#length| (select .cse1 4)) 12) (<= 0 .cse2) (= 0 (select .cse3 4)) (not (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= (+ 12 .cse2) (select |c_#length| .cse4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-14 19:50:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:32,678 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2021-12-14 19:50:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:50:32,678 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 19:50:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:32,679 INFO L225 Difference]: With dead ends: 269 [2021-12-14 19:50:32,679 INFO L226 Difference]: Without dead ends: 269 [2021-12-14 19:50:32,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=230, Invalid=1698, Unknown=12, NotChecked=1140, Total=3080 [2021-12-14 19:50:32,680 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 721 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1405 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:32,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 2095 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1456 Invalid, 0 Unknown, 1405 Unchecked, 0.7s Time] [2021-12-14 19:50:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-14 19:50:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 117. [2021-12-14 19:50:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 116 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2021-12-14 19:50:32,685 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 31 [2021-12-14 19:50:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:32,685 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2021-12-14 19:50:32,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2021-12-14 19:50:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:50:32,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:32,686 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:32,704 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-14 19:50:32,895 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,SelfDestructingSolverStorable16 [2021-12-14 19:50:32,896 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2021-12-14 19:50:32,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:32,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818287298] [2021-12-14 19:50:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:32,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:50:32,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:32,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818287298] [2021-12-14 19:50:32,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818287298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:32,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:32,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:50:32,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875105919] [2021-12-14 19:50:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:32,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:50:32,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:32,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:50:32,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:50:32,935 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-14 19:50:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:32,952 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2021-12-14 19:50:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:50:32,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 33 [2021-12-14 19:50:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:32,953 INFO L225 Difference]: With dead ends: 141 [2021-12-14 19:50:32,953 INFO L226 Difference]: Without dead ends: 141 [2021-12-14 19:50:32,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:50:32,954 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:32,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-14 19:50:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2021-12-14 19:50:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 117 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2021-12-14 19:50:32,958 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 33 [2021-12-14 19:50:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:32,959 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2021-12-14 19:50:32,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-14 19:50:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2021-12-14 19:50:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:50:32,960 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:32,960 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:32,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:50:32,960 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:32,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1373031599, now seen corresponding path program 1 times [2021-12-14 19:50:32,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:32,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775406507] [2021-12-14 19:50:32,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:32,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:33,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:33,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775406507] [2021-12-14 19:50:33,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775406507] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:33,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264397222] [2021-12-14 19:50:33,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:33,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:33,025 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-14 19:50:33,025 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-14 19:50:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:33,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:50:33,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:33,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:33,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264397222] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:33,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:33,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-14 19:50:33,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143592720] [2021-12-14 19:50:33,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:33,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:50:33,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:33,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:50:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:50:33,284 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:33,306 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2021-12-14 19:50:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:50:33,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-14 19:50:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:33,307 INFO L225 Difference]: With dead ends: 126 [2021-12-14 19:50:33,307 INFO L226 Difference]: Without dead ends: 126 [2021-12-14 19:50:33,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:50:33,307 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 148 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:33,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 182 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-14 19:50:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2021-12-14 19:50:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.311926605504587) internal successors, (143), 123 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-14 19:50:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2021-12-14 19:50:33,310 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 34 [2021-12-14 19:50:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:33,310 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2021-12-14 19:50:33,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2021-12-14 19:50:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:50:33,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:33,311 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:33,328 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-14 19:50:33,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:33,516 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash -833185593, now seen corresponding path program 2 times [2021-12-14 19:50:33,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:33,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990166955] [2021-12-14 19:50:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:33,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 19:50:33,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:33,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990166955] [2021-12-14 19:50:33,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990166955] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:33,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092902420] [2021-12-14 19:50:33,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:50:33,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:33,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:33,567 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-14 19:50:33,577 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-14 19:50:33,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:50:33,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:50:33,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:50:33,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 19:50:33,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:50:33,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092902420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:33,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:50:33,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-14 19:50:33,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071658475] [2021-12-14 19:50:33,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:33,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:50:33,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:33,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:50:33,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:50:33,757 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:33,764 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2021-12-14 19:50:33,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:50:33,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-14 19:50:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:33,765 INFO L225 Difference]: With dead ends: 104 [2021-12-14 19:50:33,765 INFO L226 Difference]: Without dead ends: 104 [2021-12-14 19:50:33,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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-14 19:50:33,766 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 100 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:33,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-14 19:50:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-14 19:50:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.348314606741573) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2021-12-14 19:50:33,772 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 39 [2021-12-14 19:50:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:33,772 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2021-12-14 19:50:33,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2021-12-14 19:50:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:50:33,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:33,772 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:33,792 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-14 19:50:33,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:33,978 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618178, now seen corresponding path program 2 times [2021-12-14 19:50:33,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:33,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436123836] [2021-12-14 19:50:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:33,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 19:50:34,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436123836] [2021-12-14 19:50:34,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436123836] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610918725] [2021-12-14 19:50:34,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:50:34,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:34,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:34,028 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-14 19:50:34,029 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-14 19:50:34,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:50:34,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:50:34,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:50:34,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 19:50:34,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:50:34,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610918725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:34,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:50:34,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-12-14 19:50:34,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503368906] [2021-12-14 19:50:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:34,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:50:34,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:34,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:50:34,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:50:34,267 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:34,284 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-12-14 19:50:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:50:34,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 39 [2021-12-14 19:50:34,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:34,285 INFO L225 Difference]: With dead ends: 82 [2021-12-14 19:50:34,285 INFO L226 Difference]: Without dead ends: 82 [2021-12-14 19:50:34,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:50:34,286 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:34,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 115 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-14 19:50:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2021-12-14 19:50:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-12-14 19:50:34,288 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2021-12-14 19:50:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:34,288 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-12-14 19:50:34,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2021-12-14 19:50:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:50:34,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:34,289 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:34,306 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-14 19:50:34,503 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,SelfDestructingSolverStorable20 [2021-12-14 19:50:34,503 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1273435421, now seen corresponding path program 2 times [2021-12-14 19:50:34,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:34,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134712588] [2021-12-14 19:50:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:34,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:34,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:34,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134712588] [2021-12-14 19:50:34,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134712588] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:34,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027061239] [2021-12-14 19:50:34,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:50:34,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:34,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:34,542 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-14 19:50:34,543 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-14 19:50:34,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:50:34,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:50:34,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:50:34,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:34,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:34,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027061239] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:34,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:34,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-12-14 19:50:34,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46243575] [2021-12-14 19:50:34,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:34,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:34,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:34,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:34,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:34,793 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:34,816 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2021-12-14 19:50:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:50:34,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 39 [2021-12-14 19:50:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:34,817 INFO L225 Difference]: With dead ends: 78 [2021-12-14 19:50:34,817 INFO L226 Difference]: Without dead ends: 78 [2021-12-14 19:50:34,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:34,818 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:34,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 180 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-14 19:50:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-12-14 19:50:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-12-14 19:50:34,819 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 39 [2021-12-14 19:50:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:34,820 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-12-14 19:50:34,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-12-14 19:50:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:50:34,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:34,820 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:34,837 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-14 19:50:35,032 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,SelfDestructingSolverStorable21 [2021-12-14 19:50:35,032 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash 993974679, now seen corresponding path program 1 times [2021-12-14 19:50:35,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:35,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561566074] [2021-12-14 19:50:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:35,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:35,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561566074] [2021-12-14 19:50:35,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561566074] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767573631] [2021-12-14 19:50:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:35,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:35,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:35,416 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-14 19:50:35,417 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-14 19:50:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:35,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-14 19:50:35,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:35,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:35,643 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:35,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:35,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:50:35,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:35,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:50:35,743 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:35,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-14 19:50:35,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-12-14 19:50:35,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:50:36,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:36,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2021-12-14 19:50:36,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:50:36,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 19:50:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:36,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:36,431 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-14 19:50:36,442 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-14 19:50:36,449 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1639 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-14 19:50:36,461 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1639 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1639) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-14 19:50:36,477 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:36,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-14 19:50:36,484 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:36,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2021-12-14 19:50:36,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2021-12-14 19:50:36,525 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:36,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-14 19:50:36,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2021-12-14 19:50:36,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2021-12-14 19:50:36,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1636 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_ArrVal_1636) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-14 19:50:36,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1631 Int) (v_ArrVal_1636 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1631)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_ArrVal_1636) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-14 19:50:36,756 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-14 19:50:36,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-14 19:50:36,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2021-12-14 19:50:36,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:36,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-12-14 19:50:36,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2021-12-14 19:50:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-14 19:50:36,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767573631] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:36,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:36,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2021-12-14 19:50:36,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120929035] [2021-12-14 19:50:36,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:36,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-14 19:50:36,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-14 19:50:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2465, Unknown=6, NotChecked=630, Total=3306 [2021-12-14 19:50:36,867 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:37,960 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2021-12-14 19:50:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:50:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 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 42 [2021-12-14 19:50:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:37,961 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:50:37,961 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:50:37,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=503, Invalid=4484, Unknown=7, NotChecked=858, Total=5852 [2021-12-14 19:50:37,963 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 151 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 572 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:37,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1015 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 833 Invalid, 0 Unknown, 572 Unchecked, 0.4s Time] [2021-12-14 19:50:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:50:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-14 19:50:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2021-12-14 19:50:37,965 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2021-12-14 19:50:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:37,966 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2021-12-14 19:50:37,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2021-12-14 19:50:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:50:37,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:37,967 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:37,992 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-14 19:50:38,184 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,SelfDestructingSolverStorable22 [2021-12-14 19:50:38,184 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2021-12-14 19:50:38,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152095870] [2021-12-14 19:50:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:38,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:50:38,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:38,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152095870] [2021-12-14 19:50:38,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152095870] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:38,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961484452] [2021-12-14 19:50:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:38,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:38,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:38,423 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-14 19:50:38,454 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-14 19:50:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-14 19:50:38,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:38,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:38,617 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:38,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:38,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:50:38,666 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-14 19:50:38,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:50:38,682 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:38,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-14 19:50:38,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:38,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-14 19:50:38,874 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:38,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-14 19:50:38,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-14 19:50:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:50:38,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:39,062 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-14 19:50:39,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:50:39,066 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) is different from false [2021-12-14 19:50:39,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) is different from false [2021-12-14 19:50:39,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-14 19:50:39,087 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-14 19:50:39,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1764 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1764))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) is different from false [2021-12-14 19:50:39,111 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2021-12-14 19:50:39,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) .cse1))))) is different from false [2021-12-14 19:50:39,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2021-12-14 19:50:39,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) is different from false [2021-12-14 19:50:39,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1761))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2021-12-14 19:50:39,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1760 Int) (v_ArrVal_1761 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1760)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1761))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2021-12-14 19:50:39,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:39,192 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:39,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 71 [2021-12-14 19:50:39,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2021-12-14 19:50:39,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:39,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-12-14 19:50:39,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:39,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-12-14 19:50:39,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 19:50:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2021-12-14 19:50:39,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961484452] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:39,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:39,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 46 [2021-12-14 19:50:39,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448761037] [2021-12-14 19:50:39,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:39,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-14 19:50:39,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:39,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-14 19:50:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1163, Unknown=11, NotChecked=858, Total=2162 [2021-12-14 19:50:39,258 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 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-14 19:50:39,401 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1761))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse4))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))))) is different from false [2021-12-14 19:50:39,403 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1761))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse4))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))))) is different from false [2021-12-14 19:50:39,405 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))))) is different from false [2021-12-14 19:50:39,407 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|)))) is different from false [2021-12-14 19:50:39,409 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse2) .cse1))))) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2021-12-14 19:50:39,410 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1764 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1764)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2021-12-14 19:50:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:39,826 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2021-12-14 19:50:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:50:39,827 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-14 19:50:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:39,827 INFO L225 Difference]: With dead ends: 118 [2021-12-14 19:50:39,827 INFO L226 Difference]: Without dead ends: 118 [2021-12-14 19:50:39,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1858, Unknown=17, NotChecked=1768, Total=3906 [2021-12-14 19:50:39,828 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 372 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 661 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:39,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 605 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 614 Invalid, 0 Unknown, 661 Unchecked, 0.2s Time] [2021-12-14 19:50:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-14 19:50:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2021-12-14 19:50:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 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-14 19:50:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-12-14 19:50:39,830 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2021-12-14 19:50:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:39,830 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-12-14 19:50:39,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.869565217391304) internal successors, (132), 47 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-14 19:50:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-12-14 19:50:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:50:39,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:39,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:39,849 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-14 19:50:40,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:40,031 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:40,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2021-12-14 19:50:40,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:40,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78845181] [2021-12-14 19:50:40,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:40,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:50:40,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:40,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78845181] [2021-12-14 19:50:40,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78845181] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:40,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892947813] [2021-12-14 19:50:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:40,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:40,412 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-14 19:50:40,413 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-14 19:50:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:40,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-14 19:50:40,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:40,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:40,614 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:40,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:40,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:50:40,668 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-14 19:50:40,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:50:40,684 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:40,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-14 19:50:40,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:40,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-14 19:50:40,915 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:40,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-14 19:50:40,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-12-14 19:50:41,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-14 19:50:41,081 INFO L388 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 32 treesize of output 14 [2021-12-14 19:50:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:50:41,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:41,269 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:41,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2021-12-14 19:50:41,417 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:41,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 108 [2021-12-14 19:50:41,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2021-12-14 19:50:41,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-14 19:50:41,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-14 19:50:42,200 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))))) is different from false [2021-12-14 19:50:42,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) is different from false [2021-12-14 19:50:42,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2021-12-14 19:50:42,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1890 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2021-12-14 19:50:42,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1885 Int)) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1885)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|))) is different from false [2021-12-14 19:50:42,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:42,869 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:42,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-14 19:50:42,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2021-12-14 19:50:42,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:42,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-12-14 19:50:42,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:42,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-14 19:50:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2021-12-14 19:50:42,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892947813] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:42,940 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:42,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 47 [2021-12-14 19:50:42,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811574147] [2021-12-14 19:50:42,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:42,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-14 19:50:42,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:42,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-14 19:50:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1596, Unknown=6, NotChecked=510, Total=2256 [2021-12-14 19:50:42,942 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 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-14 19:50:43,511 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|)))))) is different from false [2021-12-14 19:50:43,839 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (select |c_#length| .cse0) 12) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) is different from false [2021-12-14 19:50:44,158 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (select |c_#length| .cse0) 12) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) is different from false [2021-12-14 19:50:44,467 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))))) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2021-12-14 19:50:44,787 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#length| .cse0) 12) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_30| Int) (v_ArrVal_1890 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_30| v_ArrVal_1890) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-14 19:50:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:45,339 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2021-12-14 19:50:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 19:50:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-14 19:50:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:45,340 INFO L225 Difference]: With dead ends: 125 [2021-12-14 19:50:45,340 INFO L226 Difference]: Without dead ends: 125 [2021-12-14 19:50:45,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=313, Invalid=2476, Unknown=11, NotChecked=1232, Total=4032 [2021-12-14 19:50:45,341 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 524 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:45,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 1161 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 729 Invalid, 0 Unknown, 556 Unchecked, 0.3s Time] [2021-12-14 19:50:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-14 19:50:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2021-12-14 19:50:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2021-12-14 19:50:45,343 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 48 [2021-12-14 19:50:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:45,344 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2021-12-14 19:50:45,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 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-14 19:50:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2021-12-14 19:50:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:50:45,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:45,344 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:45,362 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-14 19:50:45,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:45,557 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1192975024, now seen corresponding path program 1 times [2021-12-14 19:50:45,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:45,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592843116] [2021-12-14 19:50:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:45,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:50:45,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:45,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592843116] [2021-12-14 19:50:45,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592843116] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:45,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060193841] [2021-12-14 19:50:45,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:45,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:45,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:45,602 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-14 19:50:45,603 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-14 19:50:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:45,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:50:45,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:50:45,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:50:45,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060193841] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:45,847 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:45,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-14 19:50:45,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221572059] [2021-12-14 19:50:45,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:45,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:50:45,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:50:45,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:50:45,851 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:45,882 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2021-12-14 19:50:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:50:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 49 [2021-12-14 19:50:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:45,883 INFO L225 Difference]: With dead ends: 79 [2021-12-14 19:50:45,883 INFO L226 Difference]: Without dead ends: 79 [2021-12-14 19:50:45,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:45,883 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:45,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-14 19:50:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-12-14 19:50:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-12-14 19:50:45,888 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 49 [2021-12-14 19:50:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:45,888 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-12-14 19:50:45,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2021-12-14 19:50:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:50:45,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:45,889 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:45,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:46,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-14 19:50:46,089 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1047895438, now seen corresponding path program 2 times [2021-12-14 19:50:46,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:46,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776058561] [2021-12-14 19:50:46,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:46,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:50:46,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776058561] [2021-12-14 19:50:46,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776058561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515203938] [2021-12-14 19:50:46,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:50:46,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:46,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:46,135 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:46,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 19:50:46,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:50:46,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:50:46,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:50:46,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 19:50:46,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 19:50:46,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515203938] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:46,440 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:46,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-14 19:50:46,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928168835] [2021-12-14 19:50:46,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:46,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:46,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:46,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:46,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:46,441 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:46,493 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2021-12-14 19:50:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:50:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-14 19:50:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:46,494 INFO L225 Difference]: With dead ends: 70 [2021-12-14 19:50:46,494 INFO L226 Difference]: Without dead ends: 70 [2021-12-14 19:50:46,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:50:46,494 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 78 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:46,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 127 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-14 19:50:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-14 19:50:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2021-12-14 19:50:46,496 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 51 [2021-12-14 19:50:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:46,496 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2021-12-14 19:50:46,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2021-12-14 19:50:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-14 19:50:46,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:46,497 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:46,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:46,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-14 19:50:46,703 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1925550127, now seen corresponding path program 1 times [2021-12-14 19:50:46,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:46,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518940036] [2021-12-14 19:50:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:46,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:47,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:47,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518940036] [2021-12-14 19:50:47,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518940036] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:47,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715490899] [2021-12-14 19:50:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:47,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:47,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:47,431 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:47,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-14 19:50:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:47,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-14 19:50:47,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:47,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:47,656 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:47,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:47,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:50:47,727 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-14 19:50:47,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:50:47,740 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:47,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-14 19:50:47,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:47,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-14 19:50:48,130 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:48,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2021-12-14 19:50:48,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2021-12-14 19:50:48,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2021-12-14 19:50:48,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-14 19:50:48,364 INFO L388 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 23 treesize of output 11 [2021-12-14 19:50:48,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 19:50:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:48,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:48,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2021-12-14 19:50:48,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2021-12-14 19:50:48,800 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2253 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2253) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) (forall ((v_ArrVal_2250 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse0) (<= .cse0 |c_ULTIMATE.start_dll_update_at_~data#1|))) is different from false [2021-12-14 19:50:48,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2250 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (forall ((v_ArrVal_2253 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2253) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse0) (<= .cse0 |c_ULTIMATE.start_dll_update_at_~data#1|))) is different from false [2021-12-14 19:50:48,830 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:48,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2021-12-14 19:50:48,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-12-14 19:50:51,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_2248 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-14 19:50:53,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2248 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-14 19:50:53,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) is different from false [2021-12-14 19:50:53,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-14 19:50:53,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2246 (Array Int Int)) (v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2246) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-14 19:50:53,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2245 Int) (v_ArrVal_2246 (Array Int Int)) (v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2245)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2246) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) is different from false [2021-12-14 19:50:53,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:53,687 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:53,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2021-12-14 19:50:53,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2021-12-14 19:50:53,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:53,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-12-14 19:50:53,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:53,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-14 19:50:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 19:50:53,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715490899] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:53,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:53,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 26] total 62 [2021-12-14 19:50:53,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965638734] [2021-12-14 19:50:53,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:53,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-12-14 19:50:53,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-14 19:50:53,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2725, Unknown=8, NotChecked=888, Total=3782 [2021-12-14 19:50:53,793 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 62 states, 62 states have (on average 2.129032258064516) internal successors, (132), 62 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-14 19:50:54,473 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))))) is different from false [2021-12-14 19:50:54,782 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2248 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) is different from false [2021-12-14 19:50:55,085 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (forall ((v_ArrVal_2248 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2021-12-14 19:50:55,393 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_36| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_2248 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_36| v_ArrVal_2248) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_36|))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2021-12-14 19:50:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:56,822 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2021-12-14 19:50:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 19:50:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.129032258064516) internal successors, (132), 62 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-14 19:50:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:56,822 INFO L225 Difference]: With dead ends: 68 [2021-12-14 19:50:56,822 INFO L226 Difference]: Without dead ends: 68 [2021-12-14 19:50:56,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=428, Invalid=5157, Unknown=13, NotChecked=1884, Total=7482 [2021-12-14 19:50:56,824 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 229 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:56,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 976 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1190 Invalid, 0 Unknown, 502 Unchecked, 0.5s Time] [2021-12-14 19:50:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-14 19:50:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-14 19:50:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.096774193548387) internal successors, (68), 67 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-14 19:50:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2021-12-14 19:50:56,826 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 52 [2021-12-14 19:50:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:56,826 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2021-12-14 19:50:56,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.129032258064516) internal successors, (132), 62 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-14 19:50:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2021-12-14 19:50:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 19:50:56,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:56,827 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:56,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:57,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-14 19:50:57,039 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:57,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2021-12-14 19:50:57,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:57,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645662347] [2021-12-14 19:50:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:57,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 19:50:57,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:57,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645662347] [2021-12-14 19:50:57,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645662347] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:57,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:57,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:57,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196310735] [2021-12-14 19:50:57,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:57,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:57,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:57,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:57,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:57,088 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:57,181 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2021-12-14 19:50:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:50:57,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 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 56 [2021-12-14 19:50:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:57,181 INFO L225 Difference]: With dead ends: 79 [2021-12-14 19:50:57,181 INFO L226 Difference]: Without dead ends: 79 [2021-12-14 19:50:57,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:57,182 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:57,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-14 19:50:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2021-12-14 19:50:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.109375) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-12-14 19:50:57,183 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 56 [2021-12-14 19:50:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:57,183 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-12-14 19:50:57,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2021-12-14 19:50:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 19:50:57,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:57,184 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:57,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 19:50:57,184 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:57,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2021-12-14 19:50:57,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:57,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716040809] [2021-12-14 19:50:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:57,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 19:50:57,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:57,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716040809] [2021-12-14 19:50:57,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716040809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:57,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:57,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:57,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626089545] [2021-12-14 19:50:57,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:57,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:57,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:57,264 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:57,363 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2021-12-14 19:50:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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 56 [2021-12-14 19:50:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:57,364 INFO L225 Difference]: With dead ends: 77 [2021-12-14 19:50:57,364 INFO L226 Difference]: Without dead ends: 77 [2021-12-14 19:50:57,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:57,365 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:57,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 50 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-14 19:50:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2021-12-14 19:50:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-12-14 19:50:57,366 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 56 [2021-12-14 19:50:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:57,366 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-12-14 19:50:57,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-12-14 19:50:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 19:50:57,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:57,367 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:57,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 19:50:57,367 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305133, now seen corresponding path program 1 times [2021-12-14 19:50:57,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:57,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148995396] [2021-12-14 19:50:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:57,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 19:50:57,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:57,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148995396] [2021-12-14 19:50:57,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148995396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:57,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:57,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:50:57,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709657645] [2021-12-14 19:50:57,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:57,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:57,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:57,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:57,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:57,410 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:57,474 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2021-12-14 19:50:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:57,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 57 [2021-12-14 19:50:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:57,475 INFO L225 Difference]: With dead ends: 74 [2021-12-14 19:50:57,475 INFO L226 Difference]: Without dead ends: 74 [2021-12-14 19:50:57,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:57,476 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 164 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:57,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 76 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-14 19:50:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2021-12-14 19:50:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2021-12-14 19:50:57,478 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 57 [2021-12-14 19:50:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:57,478 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2021-12-14 19:50:57,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2021-12-14 19:50:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-14 19:50:57,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:57,479 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:57,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-14 19:50:57,479 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:57,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2021-12-14 19:50:57,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:57,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287991277] [2021-12-14 19:50:57,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:57,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 19:50:57,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287991277] [2021-12-14 19:50:57,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287991277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:57,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:57,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:57,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651578110] [2021-12-14 19:50:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:57,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:57,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:57,531 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:57,608 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2021-12-14 19:50:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:57,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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 59 [2021-12-14 19:50:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:57,609 INFO L225 Difference]: With dead ends: 72 [2021-12-14 19:50:57,609 INFO L226 Difference]: Without dead ends: 72 [2021-12-14 19:50:57,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:57,609 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 150 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:57,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 63 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-14 19:50:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-14 19:50:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 71 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2021-12-14 19:50:57,611 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2021-12-14 19:50:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:57,611 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2021-12-14 19:50:57,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2021-12-14 19:50:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 19:50:57,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:57,611 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:57,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-14 19:50:57,611 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:50:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2021-12-14 19:50:57,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108348660] [2021-12-14 19:50:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:57,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 19:50:57,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:57,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108348660] [2021-12-14 19:50:57,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108348660] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:57,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641374295] [2021-12-14 19:50:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:57,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:57,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:57,956 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:57,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-14 19:50:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:58,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-14 19:50:58,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:58,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:58,156 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:58,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:58,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:50:58,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:58,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2021-12-14 19:50:58,218 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:58,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-14 19:50:58,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:58,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 19:50:58,408 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:58,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:50:58,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:58,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-14 19:50:58,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:50:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 19:50:58,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:58,801 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-14 19:50:58,811 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1))) is different from false [2021-12-14 19:50:58,818 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-14 19:50:58,830 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2021-12-14 19:50:58,847 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= 1 (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2611)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2611)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-14 19:50:58,878 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-14 19:50:58,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))))) is different from false [2021-12-14 19:50:58,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-14 19:50:58,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-14 19:50:58,968 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:58,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 87 [2021-12-14 19:50:59,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-14 19:50:59,066 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2607 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2607)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2607 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2607)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) is different from false [2021-12-14 19:50:59,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,084 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:59,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 164 treesize of output 115 [2021-12-14 19:50:59,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 159 [2021-12-14 19:50:59,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,101 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:59,101 INFO L388 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 163 treesize of output 165 [2021-12-14 19:50:59,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 211 [2021-12-14 19:50:59,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,121 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:59,122 INFO L388 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 216 treesize of output 218 [2021-12-14 19:50:59,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,137 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:59,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 166 [2021-12-14 19:50:59,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 151 [2021-12-14 19:50:59,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,153 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:59,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 157 [2021-12-14 19:50:59,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 142 [2021-12-14 19:50:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2021-12-14 19:50:59,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641374295] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:59,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:59,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 44 [2021-12-14 19:50:59,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270428635] [2021-12-14 19:50:59,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:59,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-14 19:50:59,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-14 19:50:59,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1032, Unknown=11, NotChecked=814, Total=1980 [2021-12-14 19:50:59,527 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:59,647 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2607 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2607)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2607 Int) (v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2607)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-14 19:51:01,651 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2021-12-14 19:51:01,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int) (v_ArrVal_2609 (Array Int Int))) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_2609 (Array Int Int)) (v_prenex_9 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2609))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_prenex_9))) (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2021-12-14 19:51:01,657 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse2) 1))) is different from false [2021-12-14 19:51:01,660 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) is different from false [2021-12-14 19:51:01,662 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 1)) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))))) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-14 19:51:01,665 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2613 (Array Int Int)) (v_ArrVal_2611 Int)) (= (select |c_#valid| (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2611))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2613)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-14 19:51:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:02,133 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2021-12-14 19:51:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:51:02,133 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 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 62 [2021-12-14 19:51:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:02,134 INFO L225 Difference]: With dead ends: 79 [2021-12-14 19:51:02,134 INFO L226 Difference]: Without dead ends: 79 [2021-12-14 19:51:02,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 101 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=231, Invalid=1715, Unknown=18, NotChecked=1818, Total=3782 [2021-12-14 19:51:02,135 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 111 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 692 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:02,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 468 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 596 Invalid, 0 Unknown, 692 Unchecked, 0.3s Time] [2021-12-14 19:51:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-14 19:51:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2021-12-14 19:51:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2021-12-14 19:51:02,137 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2021-12-14 19:51:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:02,137 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-12-14 19:51:02,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2021-12-14 19:51:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 19:51:02,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:02,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:02,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:02,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:02,351 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:51:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2021-12-14 19:51:02,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:02,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836015574] [2021-12-14 19:51:02,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:02,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:51:02,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836015574] [2021-12-14 19:51:02,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836015574] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:02,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810722247] [2021-12-14 19:51:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:02,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:02,846 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:02,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-14 19:51:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:03,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-14 19:51:03,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:03,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:03,082 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:03,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:51:03,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:51:03,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:51:03,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:03,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:51:03,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:03,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:51:03,190 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:03,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-14 19:51:03,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-14 19:51:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:03,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 19:51:03,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:03,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 19:51:03,574 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:03,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:51:03,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:51:03,777 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:03,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 19:51:03,781 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:03,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-14 19:51:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 19:51:03,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:04,182 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2021-12-14 19:51:04,207 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2021-12-14 19:51:04,216 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2021-12-14 19:51:04,230 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2021-12-14 19:51:04,252 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2747)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2748)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2747)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2021-12-14 19:51:04,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))) is different from false [2021-12-14 19:51:04,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2021-12-14 19:51:04,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))))))) is different from false [2021-12-14 19:51:04,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse0 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2021-12-14 19:51:04,415 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:04,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 124 [2021-12-14 19:51:04,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_prenex_18 Int) (v_ArrVal_2744 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_prenex_19 Int)) (<= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_18))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_prenex_19 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2750))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) is different from false [2021-12-14 19:51:04,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2741 Int) (v_ArrVal_2750 (Array Int Int)) (v_prenex_19 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2741)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2750))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (forall ((v_ArrVal_2738 Int) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2741 Int) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (store (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_2738)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_2741)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2738 Int) (v_prenex_18 Int) (v_ArrVal_2744 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2741 Int) (v_prenex_19 Int)) (<= (select (select (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (store (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2738)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_18))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2741)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_20)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2021-12-14 19:51:04,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,583 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:04,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 248 treesize of output 229 [2021-12-14 19:51:04,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,597 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:04,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 214 [2021-12-14 19:51:04,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 248 [2021-12-14 19:51:04,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 362 [2021-12-14 19:51:04,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,622 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:04,623 INFO L388 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 386 treesize of output 394 [2021-12-14 19:51:04,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,629 INFO L388 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 382 treesize of output 358 [2021-12-14 19:51:04,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 402 [2021-12-14 19:51:04,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 436 [2021-12-14 19:51:04,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 558 treesize of output 550 [2021-12-14 19:51:04,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,658 INFO L388 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 538 treesize of output 514 [2021-12-14 19:51:04,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,676 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:04,677 INFO L388 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 538 treesize of output 546 [2021-12-14 19:51:04,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,695 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:04,695 INFO L388 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 550 treesize of output 552 [2021-12-14 19:51:04,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 423 [2021-12-14 19:51:04,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 411 treesize of output 395 [2021-12-14 19:51:04,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 415 [2021-12-14 19:51:04,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 407 [2021-12-14 19:51:04,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:04,745 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:04,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 411 treesize of output 412 [2021-12-14 19:51:04,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 397 [2021-12-14 19:51:04,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 421 treesize of output 417 [2021-12-14 19:51:04,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 409 [2021-12-14 19:51:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 13 not checked. [2021-12-14 19:51:05,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810722247] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:05,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:05,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 21] total 60 [2021-12-14 19:51:05,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033929789] [2021-12-14 19:51:05,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:05,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-14 19:51:05,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-14 19:51:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2283, Unknown=11, NotChecked=1166, Total=3660 [2021-12-14 19:51:05,170 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 61 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 61 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:07,500 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_prenex_18 Int) (v_ArrVal_2744 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_prenex_19 Int)) (<= (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_18))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_prenex_19 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19))) (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (select .cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2750))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) is different from false [2021-12-14 19:51:07,506 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_prenex_18 Int) (v_ArrVal_2744 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2742 (Array Int Int)) (v_prenex_19 Int)) (<= (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2742))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_18))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_prenex_19 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2744))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_prenex_19))) (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (select .cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2750))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))) is different from false [2021-12-14 19:51:07,510 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse2 (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse2 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) .cse2 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= 12 (select |c_#length| .cse1))))) is different from false [2021-12-14 19:51:07,513 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (select |c_#length| .cse0) 12) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse1 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) is different from false [2021-12-14 19:51:07,517 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= 12 (select |c_#length| .cse0)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse1 v_ArrVal_2749) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse2) .cse1 v_ArrVal_2750) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2021-12-14 19:51:07,520 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#length| .cse0) 12) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (and (forall ((v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) .cse1 v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_2750) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_2748 Int) (v_ArrVal_2747 Int) (v_ArrVal_2749 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2748)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2747) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2749) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-14 19:51:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:08,537 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2021-12-14 19:51:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:51:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 61 states have internal predecessors, (164), 0 states have call successors, (0), 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 62 [2021-12-14 19:51:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:08,538 INFO L225 Difference]: With dead ends: 83 [2021-12-14 19:51:08,538 INFO L226 Difference]: Without dead ends: 83 [2021-12-14 19:51:08,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=420, Invalid=3921, Unknown=17, NotChecked=2448, Total=6806 [2021-12-14 19:51:08,539 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 188 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 815 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:08,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 682 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 824 Invalid, 0 Unknown, 815 Unchecked, 0.3s Time] [2021-12-14 19:51:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-14 19:51:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-14 19:51:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-12-14 19:51:08,541 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2021-12-14 19:51:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:08,541 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-12-14 19:51:08,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.7333333333333334) internal successors, (164), 61 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-12-14 19:51:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-14 19:51:08,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:08,542 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:08,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-14 19:51:08,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-14 19:51:08,755 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-14 19:51:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -636099954, now seen corresponding path program 1 times [2021-12-14 19:51:08,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:08,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308202754] [2021-12-14 19:51:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:08,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:51:09,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308202754] [2021-12-14 19:51:09,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308202754] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420996804] [2021-12-14 19:51:09,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:09,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:09,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:09,074 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:09,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-14 19:51:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:09,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-14 19:51:09,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:09,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:51:09,343 INFO L354 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2021-12-14 19:51:09,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2021-12-14 19:51:09,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:51:09,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:09,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:51:09,459 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:09,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-14 19:51:09,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:09,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 19:51:09,737 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-14 19:51:09,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2021-12-14 19:51:10,043 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-12-14 19:51:10,043 INFO L388 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 3 case distinctions, treesize of input 20 treesize of output 22 [2021-12-14 19:51:10,116 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:10,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-14 19:51:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:51:10,186 INFO L328 TraceCheckSpWp]: Computing backward predicates...