./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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/sll2c_prepend_unequal.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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:17:04,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:17:04,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:17:04,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:17:04,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:17:04,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:17:04,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:17:04,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:17:04,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:17:04,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:17:04,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:17:04,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:17:04,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:17:04,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:17:04,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:17:04,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:17:04,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:17:04,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:17:04,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:17:04,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:17:04,861 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:17:04,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:17:04,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:17:04,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:17:04,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:17:04,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:17:04,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:17:04,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:17:04,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:17:04,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:17:04,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:17:04,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:17:04,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:17:04,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:17:04,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:17:04,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:17:04,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:17:04,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:17:04,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:17:04,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:17:04,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:17:04,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:17:04,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:17:04,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:17:04,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:17:04,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:17:04,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:17:04,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:17:04,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:17:04,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:17:04,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:17:04,909 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:17:04,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:17:04,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:17:04,910 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:17:04,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:17:04,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:17:04,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:17:04,911 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:17:04,911 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:17:04,911 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:17:04,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:17:04,911 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:17:04,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:17:04,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:17:04,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:17:04,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:17:04,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:17:04,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:17:04,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:17:04,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:17:04,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:17:04,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:17:04,913 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2022-07-12 19:17:05,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:17:05,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:17:05,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:17:05,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:17:05,141 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:17:05,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-07-12 19:17:05,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c1c8324/cf9cfc6867d74408bbd199f48dfa9c38/FLAGbfd1a4b6c [2022-07-12 19:17:05,589 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:17:05,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-07-12 19:17:05,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c1c8324/cf9cfc6867d74408bbd199f48dfa9c38/FLAGbfd1a4b6c [2022-07-12 19:17:05,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c1c8324/cf9cfc6867d74408bbd199f48dfa9c38 [2022-07-12 19:17:05,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:17:05,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:17:05,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:17:05,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:17:05,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:17:05,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:05,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc8438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05, skipping insertion in model container [2022-07-12 19:17:05,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:05,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:17:05,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:17:05,895 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/sll2c_prepend_unequal.i[24547,24560] [2022-07-12 19:17:05,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:17:05,909 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:17:05,939 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/sll2c_prepend_unequal.i[24547,24560] [2022-07-12 19:17:05,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:17:05,969 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:17:05,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05 WrapperNode [2022-07-12 19:17:05,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:17:05,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:17:05,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:17:05,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:17:05,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,033 INFO L137 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-07-12 19:17:06,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:17:06,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:17:06,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:17:06,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:17:06,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:17:06,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:17:06,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:17:06,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:17:06,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (1/1) ... [2022-07-12 19:17:06,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:17:06,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:06,110 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) [2022-07-12 19:17:06,112 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 [2022-07-12 19:17:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:17:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:17:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:17:06,148 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:17:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:17:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:17:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:17:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:17:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:17:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:17:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:17:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:17:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:17:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:17:06,237 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:17:06,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:17:06,525 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:17:06,529 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:17:06,531 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 19:17:06,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:17:06 BoogieIcfgContainer [2022-07-12 19:17:06,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:17:06,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:17:06,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:17:06,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:17:06,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:17:05" (1/3) ... [2022-07-12 19:17:06,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699caba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:17:06, skipping insertion in model container [2022-07-12 19:17:06,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:05" (2/3) ... [2022-07-12 19:17:06,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699caba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:17:06, skipping insertion in model container [2022-07-12 19:17:06,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:17:06" (3/3) ... [2022-07-12 19:17:06,542 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2022-07-12 19:17:06,555 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:17:06,555 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-07-12 19:17:06,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:17:06,600 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3eb7c667, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9baef14 [2022-07-12 19:17:06,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-07-12 19:17:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:17:06,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:06,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:17:06,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 895521621, now seen corresponding path program 1 times [2022-07-12 19:17:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:06,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265051531] [2022-07-12 19:17:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:06,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:06,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265051531] [2022-07-12 19:17:06,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265051531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:06,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:06,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:06,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796599490] [2022-07-12 19:17:06,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:06,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:06,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:06,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:06,771 INFO L87 Difference]: Start difference. First operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-12 19:17:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:06,889 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-07-12 19:17:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:06,891 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), 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) Word has length 6 [2022-07-12 19:17:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:06,897 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:17:06,898 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 19:17:06,899 INFO L412 NwaCegarLoop]: 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 [2022-07-12 19:17:06,901 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:06,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 19:17:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-12 19:17:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.953125) internal successors, (125), 117 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2022-07-12 19:17:06,929 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2022-07-12 19:17:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:06,929 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2022-07-12 19:17:06,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-12 19:17:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2022-07-12 19:17:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:17:06,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:06,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:17:06,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:17:06,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash 895521622, now seen corresponding path program 1 times [2022-07-12 19:17:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:06,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490082673] [2022-07-12 19:17:06,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:06,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:06,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490082673] [2022-07-12 19:17:06,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490082673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:06,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:06,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:06,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679095327] [2022-07-12 19:17:06,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:06,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:06,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:06,988 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-12 19:17:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:07,059 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-07-12 19:17:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:07,059 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), 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) Word has length 6 [2022-07-12 19:17:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:07,060 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:17:07,061 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:17:07,061 INFO L412 NwaCegarLoop]: 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 [2022-07-12 19:17:07,062 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:07,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:17:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 19:17:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.921875) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-07-12 19:17:07,082 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2022-07-12 19:17:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:07,084 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-07-12 19:17:07,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-12 19:17:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-07-12 19:17:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:17:07,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:07,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:07,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:17:07,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash 164994135, now seen corresponding path program 1 times [2022-07-12 19:17:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821982651] [2022-07-12 19:17:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:07,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:07,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821982651] [2022-07-12 19:17:07,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821982651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:07,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:07,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:17:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171282403] [2022-07-12 19:17:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:07,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:17:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:17:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:17:07,161 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:17:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:07,260 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-12 19:17:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:17:07,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-12 19:17:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:07,266 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:17:07,266 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:17:07,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:17:07,272 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:07,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:17:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2022-07-12 19:17:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-07-12 19:17:07,282 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 13 [2022-07-12 19:17:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:07,283 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-07-12 19:17:07,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:17:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-07-12 19:17:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:17:07,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:07,284 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:07,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:17:07,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:07,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453220, now seen corresponding path program 1 times [2022-07-12 19:17:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:07,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546996245] [2022-07-12 19:17:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:07,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:07,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546996245] [2022-07-12 19:17:07,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546996245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:07,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:07,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:17:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079147026] [2022-07-12 19:17:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:07,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:17:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:07,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:17:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:07,422 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:07,604 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-07-12 19:17:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:17:07,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:17:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:07,607 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:17:07,607 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:17:07,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:17:07,615 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 13 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:07,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:17:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-07-12 19:17:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-07-12 19:17:07,636 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 22 [2022-07-12 19:17:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:07,636 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-07-12 19:17:07,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-07-12 19:17:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:17:07,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:07,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:07,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:17:07,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453219, now seen corresponding path program 1 times [2022-07-12 19:17:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:07,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539126986] [2022-07-12 19:17:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:07,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:07,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539126986] [2022-07-12 19:17:07,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539126986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:07,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:07,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:17:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187550411] [2022-07-12 19:17:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:07,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:17:07,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:07,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:17:07,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:07,756 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:07,939 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-07-12 19:17:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:17:07,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:17:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:07,942 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:17:07,942 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:17:07,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:17:07,943 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 11 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:07,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 443 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:17:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-07-12 19:17:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.876923076923077) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2022-07-12 19:17:07,948 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 22 [2022-07-12 19:17:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:07,948 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2022-07-12 19:17:07,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2022-07-12 19:17:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:17:07,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:07,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:07,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:17:07,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:07,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296005, now seen corresponding path program 1 times [2022-07-12 19:17:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:07,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837195657] [2022-07-12 19:17:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:08,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:17:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:08,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837195657] [2022-07-12 19:17:08,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837195657] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:08,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652352891] [2022-07-12 19:17:08,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:08,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:08,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:08,106 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) [2022-07-12 19:17:08,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:17:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:08,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 19:17:08,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:08,226 INFO L390 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 [2022-07-12 19:17:08,314 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:08,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 19:17:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:08,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:08,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652352891] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:08,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:17:08,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-07-12 19:17:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197790553] [2022-07-12 19:17:08,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:08,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:17:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:17:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:17:08,580 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:17:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:08,833 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-07-12 19:17:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:17:08,834 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-07-12 19:17:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:08,834 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:17:08,834 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:17:08,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:17:08,835 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 32 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:08,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 728 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 132 Unchecked, 0.2s Time] [2022-07-12 19:17:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:17:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-12 19:17:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.7887323943661972) internal successors, (127), 119 states have internal predecessors, (127), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-07-12 19:17:08,839 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 25 [2022-07-12 19:17:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:08,839 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-07-12 19:17:08,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:17:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-07-12 19:17:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:17:08,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:08,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:08,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:09,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 19:17:09,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296006, now seen corresponding path program 1 times [2022-07-12 19:17:09,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:09,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269357251] [2022-07-12 19:17:09,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:09,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269357251] [2022-07-12 19:17:09,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269357251] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:09,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492074431] [2022-07-12 19:17:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:09,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:09,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:09,231 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) [2022-07-12 19:17:09,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:17:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 19:17:09,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:09,323 INFO L390 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 [2022-07-12 19:17:09,511 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:09,512 INFO L390 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 [2022-07-12 19:17:09,518 INFO L390 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 16 treesize of output 11 [2022-07-12 19:17:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:09,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:13,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492074431] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:13,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:13,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-07-12 19:17:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117940168] [2022-07-12 19:17:13,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:13,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:17:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:13,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:17:13,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:17:13,742 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:17:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:14,200 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-07-12 19:17:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:17:14,200 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-07-12 19:17:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:14,201 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:17:14,201 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:17:14,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:17:14,202 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 126 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:14,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 706 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:17:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:17:14,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-07-12 19:17:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 118 states have internal predecessors, (126), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-07-12 19:17:14,206 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 25 [2022-07-12 19:17:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:14,206 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-07-12 19:17:14,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:17:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-07-12 19:17:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:17:14,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:14,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:14,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:14,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-12 19:17:14,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704927, now seen corresponding path program 1 times [2022-07-12 19:17:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:14,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562344702] [2022-07-12 19:17:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:14,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:14,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:17:14,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:14,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562344702] [2022-07-12 19:17:14,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562344702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:14,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434187991] [2022-07-12 19:17:14,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:14,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:14,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:14,616 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) [2022-07-12 19:17:14,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:17:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:14,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 19:17:14,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:14,730 INFO L390 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 [2022-07-12 19:17:14,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:14,867 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:14,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 19:17:14,953 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:14,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:17:14,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:15,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434187991] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:15,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:15,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2022-07-12 19:17:15,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779280120] [2022-07-12 19:17:15,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:15,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 19:17:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:15,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 19:17:15,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:17:15,256 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:17:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:15,499 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2022-07-12 19:17:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:17:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-07-12 19:17:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:15,500 INFO L225 Difference]: With dead ends: 138 [2022-07-12 19:17:15,501 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 19:17:15,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:17:15,501 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 263 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:15,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 452 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 308 Invalid, 0 Unknown, 196 Unchecked, 0.2s Time] [2022-07-12 19:17:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 19:17:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2022-07-12 19:17:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2022-07-12 19:17:15,505 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 37 [2022-07-12 19:17:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:15,505 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2022-07-12 19:17:15,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:17:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2022-07-12 19:17:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:17:15,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:15,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:15,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:15,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:15,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704928, now seen corresponding path program 1 times [2022-07-12 19:17:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:15,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746603462] [2022-07-12 19:17:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:15,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:15,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746603462] [2022-07-12 19:17:15,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746603462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:15,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:15,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:17:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414870729] [2022-07-12 19:17:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:15,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:17:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:17:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:17:15,898 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:16,081 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-07-12 19:17:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:17:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:17:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:16,082 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:17:16,082 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:17:16,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:17:16,083 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 353 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:16,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 126 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:17:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-12 19:17:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-07-12 19:17:16,085 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 37 [2022-07-12 19:17:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:16,086 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-07-12 19:17:16,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-07-12 19:17:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:17:16,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:16,086 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:16,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:17:16,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990998, now seen corresponding path program 1 times [2022-07-12 19:17:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:16,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341235247] [2022-07-12 19:17:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:16,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 19:17:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:16,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341235247] [2022-07-12 19:17:16,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341235247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:16,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:16,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:17:16,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775115213] [2022-07-12 19:17:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:16,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:17:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:16,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:17:16,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:16,168 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:16,290 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-07-12 19:17:16,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:17:16,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-12 19:17:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:16,291 INFO L225 Difference]: With dead ends: 123 [2022-07-12 19:17:16,292 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 19:17:16,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:17:16,292 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:16,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 289 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 19:17:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-07-12 19:17:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-07-12 19:17:16,295 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 40 [2022-07-12 19:17:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:16,295 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-07-12 19:17:16,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-07-12 19:17:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:17:16,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:16,296 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:16,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:17:16,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990997, now seen corresponding path program 1 times [2022-07-12 19:17:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:16,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962796123] [2022-07-12 19:17:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:17:16,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:16,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962796123] [2022-07-12 19:17:16,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962796123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:16,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:16,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:17:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581855858] [2022-07-12 19:17:16,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:16,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:17:16,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:17:16,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:16,392 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:16,512 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-07-12 19:17:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:17:16,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-12 19:17:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:16,513 INFO L225 Difference]: With dead ends: 103 [2022-07-12 19:17:16,513 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 19:17:16,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:17:16,514 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 79 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:16,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 304 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 19:17:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-12 19:17:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 97 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-07-12 19:17:16,517 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 40 [2022-07-12 19:17:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:16,517 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-07-12 19:17:16,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-07-12 19:17:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:17:16,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:16,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:16,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:17:16,518 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801691, now seen corresponding path program 1 times [2022-07-12 19:17:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:16,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740246270] [2022-07-12 19:17:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 19:17:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740246270] [2022-07-12 19:17:16,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740246270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846357567] [2022-07-12 19:17:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:16,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:16,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:16,816 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) [2022-07-12 19:17:16,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:17:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:16,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 19:17:16,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:17,095 INFO L390 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 9 treesize of output 5 [2022-07-12 19:17:17,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:17,229 INFO L390 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 16 treesize of output 18 [2022-07-12 19:17:17,236 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:17:17,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:17:17,300 INFO L390 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 17 treesize of output 9 [2022-07-12 19:17:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:17:17,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:17,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846357567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:17,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:17:17,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-07-12 19:17:17,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584625937] [2022-07-12 19:17:17,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:17,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:17:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:17:17,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=622, Unknown=2, NotChecked=0, Total=702 [2022-07-12 19:17:17,312 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:17,616 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-07-12 19:17:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:17:17,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-07-12 19:17:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:17,617 INFO L225 Difference]: With dead ends: 154 [2022-07-12 19:17:17,617 INFO L226 Difference]: Without dead ends: 154 [2022-07-12 19:17:17,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=756, Unknown=2, NotChecked=0, Total=870 [2022-07-12 19:17:17,618 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 77 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:17,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 863 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 573 Invalid, 0 Unknown, 133 Unchecked, 0.2s Time] [2022-07-12 19:17:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-12 19:17:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 102. [2022-07-12 19:17:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-07-12 19:17:17,621 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 41 [2022-07-12 19:17:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:17,621 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-07-12 19:17:17,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-07-12 19:17:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:17:17,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:17,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:17,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:17,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:17,827 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801690, now seen corresponding path program 1 times [2022-07-12 19:17:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:17,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169973244] [2022-07-12 19:17:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:18,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:18,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169973244] [2022-07-12 19:17:18,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169973244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:18,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487289975] [2022-07-12 19:17:18,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:18,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:18,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:18,238 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) [2022-07-12 19:17:18,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 19:17:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 19:17:18,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:18,390 INFO L390 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 [2022-07-12 19:17:18,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-12 19:17:18,687 INFO L390 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 7 treesize of output 3 [2022-07-12 19:17:18,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:18,870 INFO L390 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 [2022-07-12 19:17:18,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:18,874 INFO L390 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 16 treesize of output 18 [2022-07-12 19:17:18,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:18,878 INFO L390 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 25 treesize of output 25 [2022-07-12 19:17:18,884 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:18,884 INFO L390 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 15 treesize of output 15 [2022-07-12 19:17:18,926 INFO L390 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 17 treesize of output 9 [2022-07-12 19:17:18,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:17:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:18,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:19,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487289975] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:19,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:19,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2022-07-12 19:17:19,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113161111] [2022-07-12 19:17:19,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:19,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 19:17:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:19,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 19:17:19,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1221, Unknown=2, NotChecked=0, Total=1332 [2022-07-12 19:17:19,226 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:20,467 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2022-07-12 19:17:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:17:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-07-12 19:17:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:20,469 INFO L225 Difference]: With dead ends: 164 [2022-07-12 19:17:20,469 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 19:17:20,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=2215, Unknown=6, NotChecked=0, Total=2450 [2022-07-12 19:17:20,470 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 190 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:20,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2099 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1401 Invalid, 0 Unknown, 192 Unchecked, 0.7s Time] [2022-07-12 19:17:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 19:17:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 110. [2022-07-12 19:17:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.4125) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-07-12 19:17:20,473 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 41 [2022-07-12 19:17:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:20,473 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-07-12 19:17:20,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-07-12 19:17:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:17:20,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:20,474 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:20,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:20,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 19:17:20,687 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2031121995, now seen corresponding path program 1 times [2022-07-12 19:17:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:20,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965846818] [2022-07-12 19:17:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:20,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:20,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:20,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:20,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965846818] [2022-07-12 19:17:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965846818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:20,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301382263] [2022-07-12 19:17:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:20,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:20,760 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:20,825 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-12 19:17:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:20,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-07-12 19:17:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:20,827 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:17:20,827 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:17:20,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:20,828 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 160 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:20,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 160 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:17:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2022-07-12 19:17:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.4) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-07-12 19:17:20,833 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 42 [2022-07-12 19:17:20,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:20,833 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-07-12 19:17:20,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-07-12 19:17:20,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:17:20,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:20,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-12 19:17:20,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:17:20,836 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:20,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1993086700, now seen corresponding path program 1 times [2022-07-12 19:17:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:20,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074059024] [2022-07-12 19:17:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:20,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:21,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:21,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074059024] [2022-07-12 19:17:21,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074059024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:21,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909010317] [2022-07-12 19:17:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:21,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:21,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:21,262 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) [2022-07-12 19:17:21,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 19:17:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:21,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 19:17:21,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:21,639 INFO L390 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 7 treesize of output 3 [2022-07-12 19:17:21,686 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1453 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1453) |c_#memory_$Pointer$.base|))) is different from true [2022-07-12 19:17:21,693 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1454 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1454) |c_#memory_$Pointer$.base|)))) is different from true [2022-07-12 19:17:21,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:21,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-12 19:17:21,744 INFO L390 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 25 treesize of output 13 [2022-07-12 19:17:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-12 19:17:21,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:21,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (|v_node_create_~temp~0#1.base_38| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_38| v_ArrVal_1458) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (<= 1 .cse0) (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_38| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 19:17:21,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909010317] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:21,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:21,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2022-07-12 19:17:21,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016933914] [2022-07-12 19:17:21,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:21,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 19:17:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 19:17:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=961, Unknown=3, NotChecked=192, Total=1260 [2022-07-12 19:17:21,835 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:22,601 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-07-12 19:17:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:17:22,601 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-07-12 19:17:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:22,602 INFO L225 Difference]: With dead ends: 108 [2022-07-12 19:17:22,602 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 19:17:22,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1629, Unknown=5, NotChecked=252, Total=2070 [2022-07-12 19:17:22,603 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 58 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:22,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1594 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 984 Invalid, 0 Unknown, 192 Unchecked, 0.4s Time] [2022-07-12 19:17:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 19:17:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2022-07-12 19:17:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-07-12 19:17:22,606 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 44 [2022-07-12 19:17:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:22,606 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-07-12 19:17:22,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-07-12 19:17:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:17:22,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:22,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2022-07-12 19:17:22,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:22,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 19:17:22,824 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:22,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176968, now seen corresponding path program 1 times [2022-07-12 19:17:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:22,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628936244] [2022-07-12 19:17:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:23,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:23,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:23,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:23,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628936244] [2022-07-12 19:17:23,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628936244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:23,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699976474] [2022-07-12 19:17:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:23,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:23,441 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) [2022-07-12 19:17:23,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 19:17:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:23,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-12 19:17:23,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:23,615 INFO L390 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 [2022-07-12 19:17:23,799 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:17:23,799 INFO L390 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 [2022-07-12 19:17:23,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:17:24,014 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:24,015 INFO L390 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 [2022-07-12 19:17:24,147 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:24,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-07-12 19:17:24,151 INFO L390 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 7 treesize of output 3 [2022-07-12 19:17:24,261 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1621) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1622)))) is different from true [2022-07-12 19:17:24,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:24,298 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:17:24,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-07-12 19:17:24,322 INFO L356 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-07-12 19:17:24,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-07-12 19:17:24,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:24,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:17:24,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:17:24,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:24,570 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:17:24,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 28 [2022-07-12 19:17:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 19:17:24,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:24,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 Int) (|v_node_create_~temp~0#1.base_41| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_41| v_ArrVal_1632) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_41|) 0)) (not (< |v_node_create_~temp~0#1.base_41| |c_#StackHeapBarrier|)) (< .cse0 0) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_41| v_ArrVal_1631) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41| v_ArrVal_1633))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) .cse0)) 1)))) is different from false [2022-07-12 19:17:24,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699976474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:24,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:24,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 46 [2022-07-12 19:17:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954533445] [2022-07-12 19:17:24,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:24,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 19:17:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:24,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 19:17:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2193, Unknown=2, NotChecked=190, Total=2550 [2022-07-12 19:17:24,791 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 47 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 40 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:25,791 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-07-12 19:17:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 19:17:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 40 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-12 19:17:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:25,793 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:17:25,793 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:17:25,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=287, Invalid=3379, Unknown=2, NotChecked=238, Total=3906 [2022-07-12 19:17:25,794 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:25,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1417 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 889 Invalid, 0 Unknown, 329 Unchecked, 0.5s Time] [2022-07-12 19:17:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:17:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-12 19:17:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 117 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:17:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2022-07-12 19:17:25,797 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 46 [2022-07-12 19:17:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:25,797 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2022-07-12 19:17:25,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 40 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-07-12 19:17:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:17:25,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:25,798 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2022-07-12 19:17:25,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:26,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:26,008 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:26,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176969, now seen corresponding path program 1 times [2022-07-12 19:17:26,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:26,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839752273] [2022-07-12 19:17:26,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:27,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:27,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839752273] [2022-07-12 19:17:27,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839752273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:27,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39515422] [2022-07-12 19:17:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:27,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:27,026 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) [2022-07-12 19:17:27,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 19:17:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:27,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 114 conjunts are in the unsatisfiable core [2022-07-12 19:17:27,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:27,208 INFO L390 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 [2022-07-12 19:17:27,491 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:17:27,491 INFO L390 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 [2022-07-12 19:17:27,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:17:27,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:17:27,734 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:27,734 INFO L390 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 47 treesize of output 44 [2022-07-12 19:17:27,738 INFO L390 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 [2022-07-12 19:17:27,946 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:27,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2022-07-12 19:17:27,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-12 19:17:28,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:28,207 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:17:28,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 75 [2022-07-12 19:17:28,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:28,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:28,216 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:17:28,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 80 [2022-07-12 19:17:28,230 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-12 19:17:28,231 INFO L390 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 32 treesize of output 34 [2022-07-12 19:17:28,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 26 [2022-07-12 19:17:28,472 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:28,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-07-12 19:17:28,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-12 19:17:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:28,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:28,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39515422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:28,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:28,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 55 [2022-07-12 19:17:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746080589] [2022-07-12 19:17:28,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:28,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-12 19:17:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-12 19:17:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3570, Unknown=6, NotChecked=0, Total=3782 [2022-07-12 19:17:28,974 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 56 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 49 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:31,035 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2022-07-12 19:17:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:17:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 49 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-12 19:17:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:31,036 INFO L225 Difference]: With dead ends: 184 [2022-07-12 19:17:31,036 INFO L226 Difference]: Without dead ends: 184 [2022-07-12 19:17:31,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=373, Invalid=5783, Unknown=6, NotChecked=0, Total=6162 [2022-07-12 19:17:31,038 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 97 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:31,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 2101 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1387 Invalid, 0 Unknown, 456 Unchecked, 0.7s Time] [2022-07-12 19:17:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-12 19:17:31,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 124. [2022-07-12 19:17:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 116 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:17:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-07-12 19:17:31,041 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 46 [2022-07-12 19:17:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:31,041 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-07-12 19:17:31,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 49 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:17:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-07-12 19:17:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:17:31,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:31,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-12 19:17:31,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:31,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 19:17:31,251 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:17:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1589162821, now seen corresponding path program 2 times [2022-07-12 19:17:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:31,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069184866] [2022-07-12 19:17:31,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:31,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069184866] [2022-07-12 19:17:31,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069184866] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:31,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30333703] [2022-07-12 19:17:31,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:17:31,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:31,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:31,971 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) [2022-07-12 19:17:31,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 19:17:32,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:17:32,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:17:32,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-12 19:17:32,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:32,145 INFO L390 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 [2022-07-12 19:17:32,403 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:17:32,404 INFO L390 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 [2022-07-12 19:17:32,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:17:32,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:17:32,622 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:17:32,622 INFO L390 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 47 treesize of output 33 [2022-07-12 19:17:32,626 INFO L390 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 [2022-07-12 19:17:51,064 INFO L356 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-07-12 19:17:51,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 70 [2022-07-12 19:17:51,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:51,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:51,080 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:17:51,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2022-07-12 19:17:51,094 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 19:17:51,094 INFO L390 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 20 treesize of output 22 [2022-07-12 19:17:52,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:52,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:52,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:52,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:52,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:52,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:52,053 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:17:52,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 33 [2022-07-12 19:17:52,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:52,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:52,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:17:52,428 INFO L356 Elim1Store]: treesize reduction 142, result has 13.4 percent of original size [2022-07-12 19:17:52,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 83 treesize of output 60 [2022-07-12 19:17:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:52,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:52,661 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-07-12 19:17:52,661 INFO L390 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 24 treesize of output 23 [2022-07-12 19:17:55,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30333703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:55,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:55,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 62 [2022-07-12 19:17:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329324569] [2022-07-12 19:17:55,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:55,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 19:17:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:55,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 19:17:55,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4857, Unknown=9, NotChecked=0, Total=5112 [2022-07-12 19:17:55,240 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 56 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:11,290 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2022-07-12 19:18:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 19:18:11,291 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 56 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-07-12 19:18:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:11,292 INFO L225 Difference]: With dead ends: 151 [2022-07-12 19:18:11,292 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 19:18:11,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=503, Invalid=8796, Unknown=13, NotChecked=0, Total=9312 [2022-07-12 19:18:11,294 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 87 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:11,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1558 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 968 Invalid, 0 Unknown, 343 Unchecked, 0.4s Time] [2022-07-12 19:18:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 19:18:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2022-07-12 19:18:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 122 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:18:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2022-07-12 19:18:11,297 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 51 [2022-07-12 19:18:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:11,298 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2022-07-12 19:18:11,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 56 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2022-07-12 19:18:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:18:11,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:11,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-12 19:18:11,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:11,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 19:18:11,511 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:18:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1589162822, now seen corresponding path program 2 times [2022-07-12 19:18:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:18:11,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425305436] [2022-07-12 19:18:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:18:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:18:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:11,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:18:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:11,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:18:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:18:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:18:12,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425305436] [2022-07-12 19:18:12,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425305436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:12,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032442287] [2022-07-12 19:18:12,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:18:12,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:12,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:18:12,213 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) [2022-07-12 19:18:12,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 19:18:12,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:18:12,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:18:12,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 143 conjunts are in the unsatisfiable core [2022-07-12 19:18:12,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:12,423 INFO L390 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 [2022-07-12 19:18:12,705 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:18:12,705 INFO L390 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 [2022-07-12 19:18:12,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:12,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:12,946 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:18:12,946 INFO L390 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 56 treesize of output 38 [2022-07-12 19:18:12,949 INFO L390 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 27 treesize of output 22 [2022-07-12 19:18:17,458 INFO L356 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-07-12 19:18:17,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 82 [2022-07-12 19:18:17,474 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 19:18:17,475 INFO L390 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 20 treesize of output 22 [2022-07-12 19:18:17,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:17,489 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-12 19:18:17,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 53 [2022-07-12 19:18:17,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-07-12 19:18:18,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:18,777 INFO L356 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2022-07-12 19:18:18,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 136 treesize of output 90 [2022-07-12 19:18:18,798 INFO L356 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2022-07-12 19:18:18,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 31 [2022-07-12 19:18:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:18,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:28,092 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:18:28,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032442287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:28,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:28,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 59 [2022-07-12 19:18:28,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99145846] [2022-07-12 19:18:28,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:28,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-12 19:18:28,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:18:28,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-12 19:18:28,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=4594, Unknown=2, NotChecked=0, Total=4830 [2022-07-12 19:18:28,097 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand has 59 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 52 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:38,555 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2022-07-12 19:18:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 19:18:38,555 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 52 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-07-12 19:18:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:38,556 INFO L225 Difference]: With dead ends: 129 [2022-07-12 19:18:38,556 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 19:18:38,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2436 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=489, Invalid=8435, Unknown=6, NotChecked=0, Total=8930 [2022-07-12 19:18:38,558 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 32 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:38,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1811 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 786 Invalid, 0 Unknown, 340 Unchecked, 0.4s Time] [2022-07-12 19:18:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 19:18:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-07-12 19:18:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.316326530612245) internal successors, (129), 119 states have internal predecessors, (129), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:18:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-07-12 19:18:38,562 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 51 [2022-07-12 19:18:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:38,562 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-07-12 19:18:38,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 52 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-07-12 19:18:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:18:38,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:38,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:38,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:38,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:38,771 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:18:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680377, now seen corresponding path program 1 times [2022-07-12 19:18:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:18:38,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170145908] [2022-07-12 19:18:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:18:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:18:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:18:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:18:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:18:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:18:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170145908] [2022-07-12 19:18:39,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170145908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444610549] [2022-07-12 19:18:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:39,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:39,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:18:39,185 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) [2022-07-12 19:18:39,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 19:18:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:39,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 19:18:39,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:39,424 INFO L390 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 [2022-07-12 19:18:39,577 INFO L390 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 [2022-07-12 19:18:39,612 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:18:39,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2022-07-12 19:18:39,653 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:18:39,653 INFO L390 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 28 treesize of output 12 [2022-07-12 19:18:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:18:39,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:39,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444610549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:39,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:18:39,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 29 [2022-07-12 19:18:39,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682946105] [2022-07-12 19:18:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:39,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:18:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:18:39,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:18:39,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2022-07-12 19:18:39,659 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:39,850 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-07-12 19:18:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:18:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-07-12 19:18:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:39,851 INFO L225 Difference]: With dead ends: 146 [2022-07-12 19:18:39,851 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 19:18:39,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 19:18:39,852 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 203 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:39,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 378 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 299 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-07-12 19:18:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 19:18:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2022-07-12 19:18:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 118 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:18:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-07-12 19:18:39,858 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 52 [2022-07-12 19:18:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:39,859 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-07-12 19:18:39,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-07-12 19:18:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:18:39,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:39,860 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:39,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:40,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:40,068 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:18:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680376, now seen corresponding path program 1 times [2022-07-12 19:18:40,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:18:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241171057] [2022-07-12 19:18:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:18:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:40,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:18:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:18:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:18:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:18:40,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:18:40,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241171057] [2022-07-12 19:18:40,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241171057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:40,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618866206] [2022-07-12 19:18:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:40,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:18:40,599 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) [2022-07-12 19:18:40,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 19:18:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:40,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 19:18:40,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:41,005 INFO L390 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 [2022-07-12 19:18:41,012 INFO L390 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 [2022-07-12 19:18:41,053 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:18:41,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2022-07-12 19:18:41,064 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:18:41,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2022-07-12 19:18:41,129 INFO L390 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 23 treesize of output 15 [2022-07-12 19:18:41,130 INFO L390 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 26 treesize of output 14 [2022-07-12 19:18:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:18:41,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:41,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618866206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:41,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:18:41,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [26] total 37 [2022-07-12 19:18:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126064585] [2022-07-12 19:18:41,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:41,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 19:18:41,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:18:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 19:18:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1232, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 19:18:41,180 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:41,386 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-12 19:18:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:18:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-07-12 19:18:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:41,387 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:18:41,387 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:18:41,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 19:18:41,387 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 232 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:41,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 347 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:18:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:18:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-07-12 19:18:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 116 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:18:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-07-12 19:18:41,390 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 52 [2022-07-12 19:18:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:41,390 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-07-12 19:18:41,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-07-12 19:18:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 19:18:41,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:41,391 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:41,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:41,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 19:18:41,595 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:18:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash 965522297, now seen corresponding path program 1 times [2022-07-12 19:18:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:18:41,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097812392] [2022-07-12 19:18:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:18:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:18:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:18:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:18:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:18:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:18:42,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097812392] [2022-07-12 19:18:42,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097812392] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:42,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247336673] [2022-07-12 19:18:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:42,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:42,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:18:42,144 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) [2022-07-12 19:18:42,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 19:18:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:42,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-12 19:18:42,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:42,353 INFO L390 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 [2022-07-12 19:18:42,490 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:42,491 INFO L390 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 [2022-07-12 19:18:42,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:42,670 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:42,670 INFO L390 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 19 treesize of output 22 [2022-07-12 19:18:42,786 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:42,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2022-07-12 19:18:42,790 INFO L390 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 7 treesize of output 3 [2022-07-12 19:18:42,882 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2773) |c_#memory_$Pointer$.offset|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2772) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-07-12 19:18:42,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:42,910 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:18:42,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2022-07-12 19:18:42,917 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:18:42,917 INFO L390 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 15 treesize of output 15 [2022-07-12 19:18:42,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:42,921 INFO L390 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 34 treesize of output 34 [2022-07-12 19:18:42,962 INFO L390 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 35 treesize of output 23 [2022-07-12 19:18:43,061 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:43,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2022-07-12 19:18:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 19:18:43,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:43,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2781 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|v_node_create_~temp~0#1.base_53| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_53| v_ArrVal_2780) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_53|))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_53| v_ArrVal_2781))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) .cse2))))) (not (< |v_node_create_~temp~0#1.base_53| |c_#StackHeapBarrier|)) (not (<= 0 .cse2))))) is different from false [2022-07-12 19:18:43,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247336673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:43,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:43,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 46 [2022-07-12 19:18:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898241652] [2022-07-12 19:18:43,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:43,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 19:18:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:18:43,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 19:18:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2197, Unknown=2, NotChecked=190, Total=2550 [2022-07-12 19:18:43,295 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:44,495 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-07-12 19:18:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:18:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-07-12 19:18:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:44,497 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:18:44,497 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:18:44,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=317, Invalid=3595, Unknown=2, NotChecked=246, Total=4160 [2022-07-12 19:18:44,498 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 240 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:44,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1499 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1437 Invalid, 0 Unknown, 113 Unchecked, 0.7s Time] [2022-07-12 19:18:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:18:44,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-12 19:18:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 116 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:18:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2022-07-12 19:18:44,501 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 54 [2022-07-12 19:18:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:44,501 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2022-07-12 19:18:44,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2022-07-12 19:18:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:18:44,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:44,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2022-07-12 19:18:44,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:44,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 19:18:44,715 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:18:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2042113126, now seen corresponding path program 3 times [2022-07-12 19:18:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:18:44,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920603561] [2022-07-12 19:18:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:18:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:44,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:18:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:44,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:18:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 19:18:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 19:18:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 19:18:44,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:18:44,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920603561] [2022-07-12 19:18:44,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920603561] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:44,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648104227] [2022-07-12 19:18:44,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 19:18:44,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:44,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:18:44,768 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) [2022-07-12 19:18:44,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 19:18:44,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 19:18:44,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:18:44,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:18:44,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 19:18:45,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:45,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648104227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:45,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:18:45,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-12 19:18:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569682932] [2022-07-12 19:18:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:45,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:18:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:18:45,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:18:45,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:18:45,011 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:18:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:45,018 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-07-12 19:18:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:18:45,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-07-12 19:18:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:45,019 INFO L225 Difference]: With dead ends: 92 [2022-07-12 19:18:45,019 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 19:18:45,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:18:45,021 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 70 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:45,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 109 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:18:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 19:18:45,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-12 19:18:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-12 19:18:45,025 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 58 [2022-07-12 19:18:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:45,025 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-12 19:18:45,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:18:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-12 19:18:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 19:18:45,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:45,026 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:45,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:45,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:45,239 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:18:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -214738826, now seen corresponding path program 1 times [2022-07-12 19:18:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:18:45,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91159075] [2022-07-12 19:18:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:18:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:18:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:18:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:45,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:18:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:18:46,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:18:46,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91159075] [2022-07-12 19:18:46,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91159075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:46,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092599657] [2022-07-12 19:18:46,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:46,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:18:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:18:46,364 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) [2022-07-12 19:18:46,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 19:18:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:46,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 177 conjunts are in the unsatisfiable core [2022-07-12 19:18:46,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:46,640 INFO L390 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 [2022-07-12 19:18:46,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:18:46,960 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:46,960 INFO L390 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 [2022-07-12 19:18:47,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:47,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:47,212 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:47,212 INFO L390 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 36 treesize of output 35 [2022-07-12 19:18:47,215 INFO L390 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 [2022-07-12 19:18:47,409 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:47,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 27 [2022-07-12 19:18:47,413 INFO L390 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:47,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:18:49,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:49,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:49,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:49,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-12 19:18:49,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:49,281 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:18:49,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 53 [2022-07-12 19:18:49,288 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:18:49,288 INFO L390 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 15 treesize of output 15 [2022-07-12 19:18:50,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:50,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:50,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:50,008 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:18:50,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2022-07-12 19:18:50,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:50,329 INFO L356 Elim1Store]: treesize reduction 57, result has 21.9 percent of original size [2022-07-12 19:18:50,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 78 treesize of output 51 [2022-07-12 19:18:50,533 INFO L390 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 19 treesize of output 18 [2022-07-12 19:18:50,562 INFO L390 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 [2022-07-12 19:18:50,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:50,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:18:50,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:50,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:50,667 INFO L390 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 44 treesize of output 31 [2022-07-12 19:18:50,670 INFO L390 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 [2022-07-12 19:18:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:50,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:18:50,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:50,787 INFO L390 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 0 case distinctions, treesize of input 47 treesize of output 23 [2022-07-12 19:18:50,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:50,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:50,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:50,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3203 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3203) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-12 19:18:50,984 INFO L390 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 178 treesize of output 174 [2022-07-12 19:18:50,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:50,990 INFO L390 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 174 treesize of output 150 [2022-07-12 19:18:51,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:51,001 INFO L390 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 246 treesize of output 237 [2022-07-12 19:18:51,011 INFO L390 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 222 treesize of output 214 [2022-07-12 19:19:01,616 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse14 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4))))) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ v_arrayElimCell_166 4))))))) (.cse7 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4))))) (.cse1 (not .cse9)) (.cse11 (and .cse14 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ v_arrayElimCell_166 4)))))))) (.cse13 (not .cse5)) (.cse15 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))) (.cse21 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))))) (.cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (or (and (or .cse13 .cse14) (or .cse5 .cse15) .cse21) (not .cse4) (not .cse2))) (.cse0 (and .cse14 .cse21)) (.cse10 (or .cse1 .cse11)) (.cse8 (and .cse6 .cse7)) (.cse12 (or .cse1 .cse14))) (and (or .cse0 .cse1 .cse2) .cse3 (or .cse4 (and .cse5 (or (and .cse6 .cse7 (or .cse2 .cse8)) .cse9) .cse10 (or .cse1 .cse2 .cse11) .cse12)) (or .cse1 .cse13 .cse14) (or .cse5 (and .cse15 .cse2)) (or .cse9 (let ((.cse16 (and .cse7 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202) v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))))))) (and .cse3 (or .cse2 .cse16) (or .cse4 .cse16)))) (or .cse0 .cse1 .cse4) (or (and .cse10 (or (and .cse6 (or .cse4 .cse8) .cse7) .cse9) .cse12 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3202))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse19 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse19)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_164) .cse19)))))) (or .cse1 .cse4 .cse11)) .cse2))))) is different from false [2022-07-12 19:19:19,187 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:19:26,015 WARN L233 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:19:29,592 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse28 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| .cse27) .cse28)) (.cse26 (select (select |c_#memory_$Pointer$.offset| .cse27) .cse28))) (or (let ((.cse4 (= .cse26 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4))))) (.cse11 (= .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse12 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse17 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))) (.cse2 (not .cse11)) (.cse21 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ v_arrayElimCell_167 4))))))) (.cse5 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4))))) (.cse8 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ v_arrayElimCell_167 4))))))) (.cse10 (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ v_arrayElimCell_166 4)))))) .cse1)) (.cse0 (not .cse4))) (let ((.cse3 (or .cse0 .cse1)) (.cse9 (or .cse0 .cse10)) (.cse6 (and .cse5 .cse8)) (.cse16 (and .cse1 .cse21)) (.cse18 (or (not .cse12) (not .cse7) (and (or .cse17 .cse11) .cse21 (or .cse1 .cse2))))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 (or .cse4 (and .cse5 (or .cse6 .cse7) .cse8)) .cse9 (or .cse0 .cse7 .cse10) .cse11) .cse12) (or (and .cse3 .cse9 (or (and (or .cse6 .cse12) .cse5 .cse8) .cse4) (or .cse0 .cse12 .cse10) (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse14 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse14)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_164) .cse14))))))) .cse7) (or .cse0 .cse7 .cse16) (or .cse11 (and .cse7 .cse17)) (or .cse0 .cse12 .cse16) .cse18 (or (let ((.cse19 (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ v_arrayElimCell_167 4)))))) .cse5))) (and (or .cse19 .cse7) (or .cse19 .cse12) .cse18)) .cse4))))) (not (= .cse27 (select (select |c_#memory_$Pointer$.base| .cse25) .cse26))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.base| 0))))) is different from false [2022-07-12 19:19:29,840 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse28 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| .cse27) .cse28)) (.cse26 (select (select |c_#memory_$Pointer$.offset| .cse27) .cse28))) (or (let ((.cse4 (= .cse26 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_167 4))))) (.cse11 (= .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse12 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse17 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))))) (.cse2 (not .cse11)) (.cse21 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ v_arrayElimCell_167 4))))))) (.cse5 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4))))) (.cse8 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ v_arrayElimCell_167 4))))))) (.cse10 (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ v_arrayElimCell_167 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ v_arrayElimCell_166 4)))))) .cse1)) (.cse0 (not .cse4))) (let ((.cse3 (or .cse0 .cse1)) (.cse9 (or .cse0 .cse10)) (.cse6 (and .cse5 .cse8)) (.cse16 (and .cse1 .cse21)) (.cse18 (or (not .cse12) (not .cse7) (and (or .cse17 .cse11) .cse21 (or .cse1 .cse2))))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 (or .cse4 (and .cse5 (or .cse6 .cse7) .cse8)) .cse9 (or .cse0 .cse7 .cse10) .cse11) .cse12) (or (and .cse3 .cse9 (or (and (or .cse6 .cse12) .cse5 .cse8) .cse4) (or .cse0 .cse12 .cse10) (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse14 (+ v_arrayElimCell_167 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse14)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ v_arrayElimCell_166 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_164) .cse14))))))) .cse7) (or .cse0 .cse7 .cse16) (or .cse11 (and .cse7 .cse17)) (or .cse0 .cse12 .cse16) .cse18 (or (let ((.cse19 (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ v_arrayElimCell_167 4)))))) .cse5))) (and (or .cse19 .cse7) (or .cse19 .cse12) .cse18)) .cse4))))) (not (= .cse27 (select (select |c_#memory_$Pointer$.base| .cse25) .cse26))) (and (= .cse28 0) (= .cse27 0))))) is different from false [2022-07-12 19:19:30,100 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse28 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse28)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse28))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse22 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ v_arrayElimCell_167 4))))) (.cse10 (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ v_arrayElimCell_167 4))))))) (.cse21 (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3202 (Array Int Int)) (v_ArrVal_3196 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))))) (.cse23 (not .cse11)) (.cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (not .cse10)) (.cse14 (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (or (= (select .cse26 (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ v_arrayElimCell_167 4)))))) .cse22)) (.cse7 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164) (+ v_arrayElimCell_167 4)) |c_ULTIMATE.start_main_~uneq~0#1|))) (.cse8 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164))) (or (= (select .cse25 (+ v_arrayElimCell_167 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ v_arrayElimCell_166 4)))))))) (let ((.cse9 (and .cse7 .cse8)) (.cse12 (or .cse3 .cse14)) (.cse13 (or .cse3 .cse22)) (.cse16 (or (not .cse6) (and .cse24 (or .cse21 .cse11) (or .cse22 .cse23)) (not .cse4))) (.cse5 (and .cse22 .cse24))) (and (or .cse3 .cse4 .cse5) (or .cse6 (and (or (and .cse7 .cse8 (or .cse4 .cse9)) .cse10) .cse11 .cse12 .cse13 (or .cse3 .cse4 .cse14))) (or (let ((.cse15 (and .cse7 (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202) v_arrayElimCell_164))) (or (= (select .cse17 (+ v_arrayElimCell_167 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))))))))) (and (or .cse4 .cse15) (or .cse6 .cse15) .cse16)) .cse10) (or .cse4 (and (or .cse10 (and .cse7 .cse8 (or .cse6 .cse9))) (or .cse3 .cse6 .cse14) (forall ((v_ArrVal_3197 (Array Int Int)) (v_arrayElimCell_164 Int) (v_arrayElimCell_166 Int) (v_ArrVal_3202 (Array Int Int)) (v_arrayElimCell_167 Int) (v_ArrVal_3196 Int)) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3196)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3197) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_3202))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse19 (+ v_arrayElimCell_167 4))) (or (= (select (select .cse18 v_arrayElimCell_164) .cse19) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse20 (+ v_arrayElimCell_166 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse19)))))) .cse12 .cse13)) (or .cse11 (and .cse21 .cse4)) .cse16 (or .cse3 .cse6 .cse5) (or .cse3 .cse22 .cse23))))) (and (= .cse28 0) (= .cse0 0))))) is different from false [2022-07-12 19:19:30,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,360 INFO L390 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 127 treesize of output 121 [2022-07-12 19:19:30,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 711 treesize of output 715 [2022-07-12 19:19:30,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,444 INFO L390 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 679 treesize of output 659 [2022-07-12 19:19:30,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,459 INFO L390 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 647 treesize of output 643 [2022-07-12 19:19:30,553 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 19:19:30,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,572 INFO L390 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 63 treesize of output 69 [2022-07-12 19:19:30,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,587 INFO L390 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 360 treesize of output 354 [2022-07-12 19:19:30,595 INFO L390 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 340 treesize of output 324 [2022-07-12 19:19:30,602 INFO L390 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 166 treesize of output 158 [2022-07-12 19:19:30,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,654 INFO L390 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 63 treesize of output 69 [2022-07-12 19:19:30,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,673 INFO L390 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 216 treesize of output 219 [2022-07-12 19:19:30,679 INFO L390 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 102 treesize of output 98 [2022-07-12 19:19:30,685 INFO L390 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 198 treesize of output 190 [2022-07-12 19:19:30,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,726 INFO L390 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 125 treesize of output 119 [2022-07-12 19:19:30,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,738 INFO L390 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 695 treesize of output 681 [2022-07-12 19:19:30,751 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,752 INFO L390 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 667 treesize of output 653 [2022-07-12 19:19:30,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,764 INFO L390 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 643 treesize of output 641 [2022-07-12 19:19:30,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,917 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 69 [2022-07-12 19:19:30,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:19:30,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:19:30,937 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-07-12 19:19:30,937 INFO L390 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 11 [2022-07-12 19:19:30,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,949 INFO L390 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 61 treesize of output 67 [2022-07-12 19:19:30,955 INFO L390 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 208 treesize of output 200 [2022-07-12 19:19:30,961 INFO L390 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 98 treesize of output 96 [2022-07-12 19:19:30,964 INFO L390 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 194 treesize of output 190 [2022-07-12 19:19:30,993 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:30,994 INFO L390 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 63 treesize of output 69 [2022-07-12 19:19:31,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:31,004 INFO L390 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 216 treesize of output 219 [2022-07-12 19:19:31,009 INFO L390 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 202 treesize of output 194 [2022-07-12 19:19:31,013 INFO L390 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 98 treesize of output 94 [2022-07-12 19:19:31,055 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 19:19:31,055 INFO L390 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 61 treesize of output 1 [2022-07-12 19:19:31,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:31,066 INFO L390 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 63 treesize of output 69 [2022-07-12 19:19:31,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:31,077 INFO L390 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 360 treesize of output 354 [2022-07-12 19:19:31,083 INFO L390 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 340 treesize of output 332 [2022-07-12 19:19:31,088 INFO L390 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 332 treesize of output 316 [2022-07-12 19:19:31,115 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 19:19:31,116 INFO L390 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 125 treesize of output 1 [2022-07-12 19:19:31,124 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 19:19:31,125 INFO L390 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 61 treesize of output 1 [2022-07-12 19:19:31,132 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 19:19:31,133 INFO L390 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 125 treesize of output 1 [2022-07-12 19:19:50,764 WARN L233 SmtUtils]: Spent 18.69s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:19:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092599657] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:19:50,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:19:50,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 66 [2022-07-12 19:19:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001424953] [2022-07-12 19:19:50,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:19:50,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-12 19:19:50,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:19:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-12 19:19:50,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=5880, Unknown=43, NotChecked=790, Total=6972 [2022-07-12 19:19:50,768 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 66 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 57 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:19:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:57,129 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-07-12 19:19:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 19:19:57,130 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 57 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-07-12 19:19:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:57,130 INFO L225 Difference]: With dead ends: 92 [2022-07-12 19:19:57,130 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 19:19:57,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 62.1s TimeCoverageRelationStatistics Valid=560, Invalid=10547, Unknown=43, NotChecked=1060, Total=12210 [2022-07-12 19:19:57,132 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 65 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:57,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1787 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1967 Invalid, 0 Unknown, 50 Unchecked, 1.0s Time] [2022-07-12 19:19:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 19:19:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-12 19:19:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.25) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:19:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-07-12 19:19:57,134 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 59 [2022-07-12 19:19:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:57,134 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-07-12 19:19:57,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 57 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:19:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-07-12 19:19:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 19:19:57,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:57,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:19:57,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:19:57,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:19:57,363 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-07-12 19:19:57,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:19:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash -205595639, now seen corresponding path program 1 times [2022-07-12 19:19:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:19:57,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804164980] [2022-07-12 19:19:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:19:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:57,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:19:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:19:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:58,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:19:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:19:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:19:58,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804164980] [2022-07-12 19:19:58,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804164980] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:19:58,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292563046] [2022-07-12 19:19:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:58,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:19:58,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:19:58,545 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) [2022-07-12 19:19:58,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 19:19:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:58,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-12 19:19:58,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:58,781 INFO L390 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 [2022-07-12 19:19:58,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:19:58,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:58,950 INFO L390 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 [2022-07-12 19:19:58,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:19:59,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:59,086 INFO L390 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 [2022-07-12 19:19:59,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:19:59,339 INFO L390 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 7 treesize of output 3 [2022-07-12 19:19:59,380 INFO L390 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 [2022-07-12 19:19:59,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:59,681 INFO L390 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 [2022-07-12 19:19:59,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:59,692 INFO L390 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 [2022-07-12 19:20:00,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:20:00,118 INFO L390 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 19 treesize of output 23 [2022-07-12 19:20:00,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:20:00,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-12 19:20:00,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:00,444 INFO L390 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 25 treesize of output 20 [2022-07-12 19:20:00,569 INFO L390 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 [2022-07-12 19:20:00,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:00,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-07-12 19:20:00,663 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:20:00,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 31 [2022-07-12 19:20:00,686 INFO L356 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-07-12 19:20:00,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2022-07-12 19:20:00,878 INFO L390 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 32 treesize of output 20 [2022-07-12 19:20:01,040 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:20:01,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2022-07-12 19:20:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:01,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:20:01,141 INFO L390 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 302 treesize of output 298 [2022-07-12 19:20:12,059 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 44 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:21:05,118 WARN L233 SmtUtils]: Spent 47.70s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:21:32,584 WARN L233 SmtUtils]: Spent 27.25s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)